#include <fstream>

#define MAXN 100002

using namespace std;

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

int N, nn, dp[MAXN], v[MAXN], dad[MAXN];

inline int binarySearch(int val) {
    int step, ii;
    for (step = 1; step <= nn; step <<= 1);

    for (ii = 0; step; step >>= 1) {
        if (ii + step <= nn && v[dp[ii + step]] < val)
            ii += step;
    }
    return ii;
}

///dp[i] = poz elem care se afla al i-lea in sc de lungime maxima
//trebuie sa fac afisarea recursiva fiindca, daca as face-o iterativa,
//ar considera si valorile care nu sunt in ordine:
//ex: 1 12 13 0 - afiseaza 0 12 13
//asadar fac iterativ tinand cont de ce valoare a fost cand am facut cautarea binara

inline void Afis(int node) {
    if (node) {
        Afis(dad[node]);
        fout << v[node] << " ";
    }
}

inline void Read() {
    int poz; nn = 0;

    fin >> N;

    for (int i = 1; i <= N; i++) {
        fin >> v[i];
        poz = binarySearch(v[i]);
        nn = max(nn, poz + 1);
        dp[poz + 1] = i;
        dad[i] = dp[poz];
    }

    Afis(dp[nn]);
}

int main () {
    Read();

    fin.close(); fout.close(); return 0;
}