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

ifstream fin("psir.in");
ofstream fout("psir.out");

vector <int> a[2001];
vector <int> s[2001];
int n, v[2001];
const long long mod = pow(2, 32);

int main()
{
    fin >> n;

    int aux;

    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];

        for (int j = i - 1; j >= 1; j--)
        {
            a[i].push_back(v[j]);
            s[i].push_back(1);
            aux = a[j].size();
            while (aux)
                aux >>= 1;
        }

        sort(a[i].begin(), a[i].end());
    }
    
    return 0;
}