#include <cstdio>

 #define MAXN 100000+10

 int a[MAXN], tmp[MAXN];

 int cnt;

 void merge_sort(int l, int r)

 {

     if (r-l == )  return;

     int mid = l + (r-l)/;

     merge_sort(l, mid);

     merge_sort(mid, r);

     int p = l, q = mid, k = l;

     while (p < mid || q < r)

     {

         if (q >= r || (p < mid && a[p] < a[q]))

             tmp[k++] = a[p++];

         else

         {

             tmp[k++] = a[q++];

             cnt += mid - p;

         }

     }

     for (int i = l; i < r; i++)

         a[i] = tmp[i];

 }

 int main()

 {

 #ifdef LOCAL

     freopen("in", "r", stdin);

 #endif

     int n;

     while (scanf("%d", &n) && n)

     {

         for (int i = ; i < n; i++)

             scanf("%d", &a[i]);

         cnt = ;

         merge_sort(, n);

         if (cnt % )  printf("Marcelo\n");

         else  printf("Carlos\n");

     }

     return ;

 }