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


int main() {
    int n;
    cin>>n;
    int arr[n+1];
    for(int i=1;i<=n;i++)
        {
        cin>>arr[i];
        }
    int min1=3*n;
    int max1=-111111111;
    int maxIndex=-1;
    int minIndex=-1;
    for(int i=1;i<=n;i++)
        arr[i]=i-arr[i];
    for(int i=1;i<=n;i++)
    {
       if(arr[i]>max1)
           {
              maxIndex=i;
           max1=arr[i];
           }
        if(arr[i]<min1)
        {
            minIndex=i;
            min1=arr[i];
        }
    }
    if(maxIndex==minIndex)
        {
        cout<<"Cool Array"<<endl;
    }
    else
        {
        cout<<minIndex<<" "<<maxIndex<<endl;
    }
    return 0;
}