#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for (int i=a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;


char d1[10][10][1005][1005];
char d2[10][10][1005][1005];
char d3[10][10][1005][1005];
char c1[10][10][1005][1005];
char c2[10][10][1005][1005];
char c3[10][10][1005][1005];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int p;
    cin >> p;
    vector<int>a(p+1);
    for(int i = 1; i<=p; i++){
        cin >> a[i];
    }
    int rq = (p+39)/40 + 1;
    for(int i = 1; i<=p; i++){
        for(int j = i+1; j<=p; j++){
            for(int k = j+1; k<=p; k++){
                {
                    if(!d1[a[i]][a[j]][j-i][k-j]){
                        d1[a[i]][a[j]][j-i][k-j] = a[k]+'0';
                    }
                    else if(d1[a[i]][a[j]][j-i][k-j] != a[k] + '0'){
                        d1[a[i]][a[j]][j-i][k-j] = 1;
                    }
                    c1[a[i]][a[j]][j-i][k-j]++;
                    c1[a[i]][a[j]][j-i][k-j] = min(c1[a[i]][a[j]][j-i][k-j],(char)30);
                }
                {
                    if(!d2[a[i]][a[k]][j-i][k-j]){
                        d2[a[i]][a[k]][j-i][k-j] = a[j]+'0';
                    }
                    else if(d2[a[i]][a[k]][j-i][k-j] != a[j] + '0'){
                        d2[a[i]][a[k]][j-i][k-j] = 1;
                    }
                    c2[a[i]][a[k]][j-i][k-j]++;
                    c2[a[i]][a[k]][j-i][k-j] = min(c2[a[i]][a[k]][j-i][k-j],(char)30);
                }
                {
                    if(!d3[a[j]][a[k]][j-i][k-j]){
                        d3[a[j]][a[k]][j-i][k-j] = a[i]+'0';
                    }
                    else if(d3[a[j]][a[k]][j-i][k-j] != a[i] + '0'){
                        d3[a[j]][a[k]][j-i][k-j] = 1;
                    }
                    c3[a[j]][a[k]][j-i][k-j]++;
                    c3[a[j]][a[k]][j-i][k-j] = min(c3[a[j]][a[k]][j-i][k-j],(char)30);
                }
                
            }
        }
    }
    for(int i = 1; i<=p; i++){
        for(int j = i+1; j<=p; j++){
            for(int k = j+1; k<=p; k++){
                if(d1[a[i]][a[j]][j-i][k-j] == a[k]+'0' && d2[a[i]][a[k]][j-i][k-j] == a[j] + '0' && d3[a[j]][a[k]][j-i][k-j] == a[i] + '0'){
                    int cnt1 = c1[a[i]][a[j]][j-i][k-j];
                    int cnt2 = c2[a[i]][a[k]][j-i][k-j];
                    int cnt3 = c3[a[j]][a[k]][j-i][k-j];
                    if(cnt1 == cnt2 && cnt2 == cnt3 && cnt1 >= rq){
                        cout << "triple correlation " << a[i] << "(" << j-i << ")" << a[j] << "(" << k-j << ")" << a[k] << " found\n";
                        return 0;
                    }
                }
            }
        }
    }
    cout << "random sequence\n";

    return 0;
}