#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
/*long int* minimum(long int *x,long int s,long int e)
{
    long int i;
    long int min = x[s];
    long int minid =s;
    long int *ans = (long int *)malloc(2*sizeof(long int));
    for(i=s+1;i<=e;i++)
    {
        if(x[i]<min)
        {
            min = x[i];
            minid = i;
        }
    }
    if(minid == s)
    {
       // ans[0] = s+1;
        ans = minimum(x,s+1,e);
       return ans;
    }
    else
    {
        ans[0] = s;
        ans[1] = minid;
    }
         return ans;
    
}*/
long int cmpfunc (const void * a, const void * b)
{
   return ( *(long int*)a - *(long int*)b );
}
int main() {

    long int N,i,j,c,ans1,ans2,max,temp,min;
    int flag=0;
    long int *x,*ans;
    scanf("%ld",&N);
    x = (long int *)malloc(N*sizeof(long int));
     ans = (long int *)malloc(N*sizeof(long int));
    min = 500001;
    max = -500001;
    for(i=0;i<N;i++)
    {
        scanf("%ld",&x[i]);
        if(i>0)
        {
            //printf("%ld < %ld\n",x[i],x[i-1] + (i-1));
            if(x[i]< (x[i-1] + (i-1)))
            {
                //printf(">>%ld < %ld\n",x[i],x[i-1] + (i-1));
                flag = 1;
            }  
        }
        x[i] = x[i]-i;
        if(x[i]<min)
        {
            min = x[i];
            ans2 = i;
        }
        if(x[i]>max)
        {
            max = x[i];
            ans1 = i;
        }
    }
    if(flag == 0)
    {
        printf("Cool Array");
        exit(0);
    }
    /*ans = N;
    /*for(i=0;i<N;i++)
    {
        c = 0;
        for(j=0;j<N;j++)
        {
            if(x[i]>x[j])
                c++;
        }
        ans[i] = c+1; 
    }*/
   /*qsort(x, N, sizeof(long int), cmpfunc);
   min = x[0];
   max = x[1];
    max =0;
    for(i=0;i<N;i++)
    {
         for(j=i+1;j<N;j++)
         {
             if(x[i]>x[j])
             {
                 temp =  x[i]-x[j] + j-i;
                if(temp>max)
                {
                    max = temp;
                    ans1 = i;
                    ans2=j;
                }
             }
         }
    }*/
    printf("%ld %ld\n",ans1+1,ans2+1);
        
    
    return 0;
}