import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
static int n;
	static int MAXN = 500000;
	static int count = 0;
	static int[] f;
	static int[] countArray;
	static ArrayList<Integer> maxArray;
	public static void update(int i) {
		while (i <= n) {
			f[i]++;
			i = i + (i & (-i));
		}
	}
	public static void get(int i) {
		while (i > 0) {
			count += f[i];
			i = i - (i & (-i));
		}
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		f = new int[n+1];
		countArray = new int[n];
		maxArray = new ArrayList<Integer>();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			int j = sc.nextInt(); 
			a[i] = j;
		}
		for (int i = 0; i < n; i++) {
			int j = a[i];
			count = 0;
			get(j);
			int count1 = count;
			count = 0;
			get(n);
			count = count - count1;
			update(j);
			countArray[i] = count;
		}
		int max = countArray[0];
		for (int i = 1; i < n; i++) {
			if (countArray[i] > max) {
				max = countArray[i];
			}
		}
		for (int i = 0 ; i < n ; i++) {
			if (countArray[i] == max) {
				if (i == 0 || countArray[i] != countArray[i-1]) {
					maxArray.add(i);
				}
			}
		}
		max = -1;
		int maxa = 0;
		int maxb = 0;
		for (int i = 0 ; i < maxArray.size(); i++) {
			for (int j = 0 ; j < n+1; j++) {
				f[j] = 0;
			}
			int ib = maxArray.get(i);
			int greaterBCount = 0;
			for (int j = ib-1; j>=0; j--) {
				int valA = a[j];
				if (valA > a[ib]) {
					count = 0;
					get(n);
					int count1 = count;
					count = 0;
					get(valA);
					int count2 = count;
					count = 0;
					get(a[ib]);
					int count3 = count;
					int greaterACount = count1 - count2 ;
					if (greaterBCount - greaterACount + count2 - count3 > max) {
						max = greaterBCount - greaterACount + count2 - count3;
						maxa = j;
						maxb = ib;
					} else if (greaterBCount - greaterACount + count2 - count3 == max && 
							(maxa > j || (maxa == j && maxb > ib))) {
						max = greaterBCount - greaterACount + count2 - count3;
						maxa = j;
						maxb = ib;
					}
				}
				update(valA);
				if (a[j] > a[ib]) {
					greaterBCount++;
				}
			}
		}
		if (max == -1) {
			System.out.println("Cool Array");
		} else {
			System.out.println("" + (maxa+1) + " " + (maxb+1));
		}
	}
}