#include <fstream>

using namespace std;

const int N = 1e5;
const int INF = 2e9 + 1;

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

int v[N], val_min[N+1], lung[N-1];

int caut_bin_ultim(int v[], int n, int val)
{
    ///pozitia ultimului element al lui v care e < val
    int st = 1, dr = n, rez = 0;
    while (st <= dr)
    {
        int m = (st + dr) / 2;
        if (v[m] < val)
        {
            rez = m;
            st = m + 1;
        }
        else
        {
            dr = m - 1;
        }
    }
    return rez;
}

void refac_subsir(int p, int lungime, int val)
{
    if (lungime == 0)
    {
        return;
    }
    if (lung[p] == lungime && v[p] < val)
    {
        refac_subsir(p - 1, lungime - 1, v[p]);
        out << v[p] << " ";
    }
    else
    {
        refac_subsir(p - 1, lungime, val);
    }
}

int main()
{
    int n;
    in >> n;
    for (int i = 0; i < n; i++)
    {
        in >> v[i];
    }
    int n_val_min = 0, i_max = 0;
    for (int i = 0; i < n; i++)
    {
        int j = caut_bin_ultim(val_min, n_val_min, v[i]);
        if (j == n_val_min)
        {
            n_val_min++;
        }
        lung[i] = j + 1;
        val_min[j+1] = v[i];
        if (lung[i] > lung[i_max])
        {
            i_max = i;
        }
    }
    out << lung[i_max] << "\n";
    refac_subsir(i_max, lung[i_max], INF);
    in.close();
    out.close();
    return 0;
}