#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int a[500005];
vector<pair<int,int> > b,c;

int main() {
    int n;
    
    bool flag=true;
    scanf("%d",&n);
    for(int i=1; i<=n; i++) {
        scanf("%d",&a[i]);
        if(i>1 && a[i]<a[i-1]) flag=false;
        if(a[i] > i)  {
            b.push_back(make_pair(a[i]-i,-i));            
        }
        if(a[i] < i) {
            c.push_back(make_pair(i-a[i],-i));
        }
    }
    if(flag) { printf("Cool Array\n"); return 0; }
    sort(b.begin(),b.end());
    sort(c.begin(),c.end());
    
  //  for(int i=0; i<b.size(); i++)
    //    printf(" b[%d] = ( %d , %d )\n",i,b[i].first,b[i].second);
    //for(int i=0; i<c.size(); i++)
      //  printf(" c[%d] = ( %d , %d )\n",i,c[i].first,c[i].second);        
    int k = min(5,min((int)b.size(),(int)c.size()));;
    int ans = 0, a1 = -b[b.size()-1].second, a2 = -c[c.size()-1].second;
    for(int i=1; i<=k; i++) {
        for(int j=1; j<=k; j++) {
            int x = -b[b.size()-i].second;
            int y = -c[c.size()-j].second;
            if(x>y) continue;
            int cnt = 0;
            for(int p=x+1; p<y; p++) {
                if(a[p]>a[y]) cnt++;
                else cnt --;
                if(a[p]<a[x]) cnt++;
                else cnt --;
            }
            if(cnt > ans) { ans=cnt; a1 = x; a2 = y; }
        }
    }
    printf("%d %d\n",a1, a2);
    
    
    return 0;
}