#include <iostream>
#include<cmath>
using namespace std;

const int MAXVALS = 1000;

const int NONE = -1;
const int SEVERAL = -2;

int vals[MAXVALS];
int cvals[10][10][MAXVALS][MAXVALS];
int counts[10][10][MAXVALS][MAXVALS] = {0};

int check(int a, int b, int c, int d1, int d2, int p)
{
    int location = -1;
    for(int i=p-1; i>= d1+d2; i--) {
        if (vals[i] == c) {
            if (vals[i-d2] == b) {
                if (vals[i-d1-d2] == a)
                    location = i-d1-d2;
                else
                    return -1;
            }
            else if (vals[i-d1-d2] == a)
                return -1;
        }
    }
    return location;
}

int main()
{
    int p, targetNum;
    cin >> p;
    targetNum = ceil(p/40.0) + 1;
    for(int i=0; i<p; i++) {
        cin >> vals[i];
    }
    for(int a=0; a<=9; a++)
        for(int b=0; b<=9; b++)
            for(int i=0; i<p; i++)
                for(int j=0; j<p; j++) {
                    cvals[a][b][i][j] = NONE;
                    counts[a][b][i][j] = 1;
                }
    for(int i=0; i<p; i++) {
        int a = vals[i];
        for(int j=i+1; j<p; j++) {
            int b = vals[j];
            int diff1 = j-i;
            for(int k=j+1; k<p; k++) {
                int diff2 = k-j;
                if (cvals[a][b][diff1][diff2] == NONE)
                    cvals[a][b][diff1][diff2] = vals[k];
                else if (cvals[a][b][diff1][diff2] != vals[k])
                    cvals[a][b][diff1][diff2] = SEVERAL;
                else
                    counts[a][b][diff1][diff2]++;
            }
        }
    }
    bool found = false;
    int earliestLoc = p;
    int sava, savb, savc, savd1, savd2;
    for(int a=0; a<=9; a++) {
        for(int b=0; b<=9; b++) {
            for(int diff1 = 1; diff1 < p-1; diff1++) {
                for(int diff2 = 1; diff2 < p-1; diff2++) {
                    int c = cvals[a][b][diff1][diff2];
                    if (c != NONE && c != SEVERAL && counts[a][b][diff1][diff2] >= targetNum) {
                        int location = check(a, b, c, diff1, diff2, p);
                        if (location == -1)
                            continue;
                        else if (location < earliestLoc) {
                            found = true;
                            sava = a, savb = b, savc = c, savd1 = diff1, savd2 = diff2;
                            earliestLoc = location;
                        }
                        else if (location == earliestLoc && (diff1 < savd1 || (diff1 == savd1 && diff2 < savd2))) {
                            sava = a, savb = b, savc = c, savd1 = diff1, savd2 = diff2;
                        }
                    }
                }
            }
        }
    }
    if (!found)
        cout << "random sequence" << endl;
    else
        cout << "triple correlation " << sava << "(" << savd1 << ")" << savb << "(" << savd2 << ")" << savc << " found" << endl;

}