#include <iostream>
#include <stdio.h>

using namespace std;

const int maxn = 500007;

int fwt[maxn];
int ar[maxn];
int l[maxn];
int r[maxn];
int rl,rr,ml=-1,mr=-1;

int n;

void update(int p,int v)
{
	while(p<=n)
	{
		fwt[p]+=v;
		p += p&-p;
	}
}
int query(int p)
{
	int r(0);
	while(p>=1)
	{
		r += fwt[p];
		p -= p&-p;
	}
	return r;
}

int main()
{
	// 	#ifndef ONLINE_JUDGE
	// freopen("i.in","r",stdin);
	// // freopen("a.out","w",stdout);
	// #endif
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%d",&ar[i]);
	for(int i=1;i<=n;i++) fwt[i]=0;
	for(int i=n;i>=1;i--) r[i] = query(ar[i]-1), update(ar[i],1);
		
	for(int i=1;i<=n;i++) fwt[i]=0;
	for(int i=1;i<=n;i++) l[i] = i-query(ar[i]-1)-1, update(ar[i],1);
		
	// for(int i=1;i<=n;i++)
	// {
	// 	cout<<l[i]<<" "<<r[i]<<endl;
	// }
	int count=0;
	for(int i=1;i<=n;i++) 
		{
			if(r[i]>mr) mr = r[i], rr = i;
			if(r[i]==0)
				count++;
		}
	for(int i=n;i>=1;i--) if(l[i]>=ml) ml = l[i], rl = i;
	if(count==n or rr==rl)
		cout<<"Cool Array"<<endl;
	else

	cout<<rr<<" "<<rl<<endl;
	return 0;
}