#include<cstdio>
#include<iostream>
#include<cstring>
#define INF 0x3f3f3f3f

using namespace std;

long long arr[100005],swp;

long long L[50005];

long long R[50005];

void Merge(long long p,long long q,long long r)
{

    long long i,j,k,n1,n2;

    n1 = q-p+1;

    n2 = r-q;


    for(i=1; i<=n1; i++)
        L[i]=arr[p+i-1];

    for(i=1; i<=n2; i++)
        R[i]=arr[q+i];


    L[n1+1]=INF;

    R[n2+1]=INF;

    i=j=1;


    for(k=p; k<=r; k++)
    {
        if(L[i]<=R[j])
        {
            arr[k]=L[i];
            i++;
        }
        else
        {
            arr[k]=R[j];

            swp+=(n1-i+1);

            j++;
        }
    }
}

void merge_sort(long long p,long long r)
{

    long long q;


    if(p<r)
    {
        q=(p+r) /2;

        merge_sort(p,q);

        merge_sort(q+1,r);

        Merge(p,q,r);
    }
}

int main()
{
    long long n,i;

    while(scanf("%lld",&n)&&n)
    {
        for(i=1; i<=n; i++)
            scanf("%lld",&arr[i]);

            swp = 0;

        merge_sort(1,n);

        if(swp&1)
        {
            printf("Marcelo\n");
        }
        else
        {
            printf("Carlos\n");
        }
    }

    return 0 ;
}