#include <fstream>
#include <vector>

using namespace std;

const int INF = 1e9;

void refac_subsirul(ofstream &out, vector <int> &v, vector <int> &lung, int p, int lg, int val)
{
    ///cautam incepand la stanga poz. p elem. <= val, cu subsirul de lungime lg
    if (p < 0)
    {
        return;
    }
    if (v[p] <= val && lung[p] == lg)
    {
        refac_subsirul(out, v, lung, p - 1, lg - 1, v[p] - 1);
        out << v[p] << " ";
    }
    else
    {
        refac_subsirul(out, v, lung, p - 1, lg, val);
    }
}

int caut_bin(vector <int> &vmin, int val)
{
    ///cautam binar intre 0 si vmin.size()-1 cel mai mare j cu vmin[j] < val
    int st = 0, dr = vmin.size() - 1, j0 = 0;
    while (st <= dr)
    {
        int m = (st + dr) / 2;
        if (vmin[m] < val)
        {
            j0 = m;
            st = m + 1;
        }
        else
        {
            dr = m - 1;
        }
    }
    return j0;
}

int main()
{
    ifstream in("scmax.in");
    ofstream out("scmax.out");
    int n, ultimul = 0;
    in >> n;
    vector <int> v(n), lung(n), valmin;
    valmin.push_back(-INF);///valoare artificiala pe pozitia 0
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
        int j0 = caut_bin(valmin, v[i]);
        lung[i] = 1 + j0;
        if (j0 == valmin.size() - 1)
        {
            valmin.push_back(v[i]);
        }
        else
        {
            valmin[j0+1] = v[i];
        }
        if (lung[i] > lung[ultimul])
        {
            ultimul = i;
        }
    }
    out << lung[ultimul] << "\n";
    refac_subsirul(out, v, lung, ultimul, lung[ultimul], v[ultimul]);
    in.close();
    out.close();
    return 0;
}