#include <bits/stdc++.h>
#define Nmax 5005
#define INF 1000005

using namespace std;

int a[Nmax], lis[Nmax];
int urm[Nmax], n, sol[Nmax];

void Citire()
{
    ifstream f("subsir2.in");
    f >> n;
    for(int i = 1; i <= n; i++)
        f >> a[i];
    f.close();
}

void Lis()
{
    lis[n] = 1;
    urm[n] = n + 1;
    sol[n] = a[n];
    for(int i = n - 1; i >= 1; i--)
    {
        int maxim = 0;
        int minim = INF;
        int p = n + 1;
        int x = a[i];
        for(int j = i + 1; j <= n; j++)
        {
            if(x < a[j] && maxim < lis[j])
            {
                maxim = lis[j];
                p = j;
                minim = min(minim, a[j]);
            }
            else if(x < a[j] && maxim == lis[j])
                if(a[j] < minim)
                    p = j;
            lis[i] = maxim + 1;
            urm[i] = p;
        }
    }
    int p = lis[1];
    for(int i = 2; i <= n; i++)
        p = max(p, lis[i]);
    bool ok = true;
    int aux;
    for(int i = 1; i <= n && ok == true; i++)
        if(p == lis[i])
            aux = i,
            ok = false;
    ofstream g("subsir2.out");
    g << a[aux] << " ";
    while(urm[aux] != n + 1)
    {
        aux = urm[aux];
        g << aux << " ";
    }
    g << "\n";
    g.close();
}

int main()
{
    Citire();
    Lis();
    return 0;
}