#include <fstream>

using namespace std;

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

long long N, kp, kq, j, a[100003], poz[100003], q[100003], SOL, ult;
void put(long long x, long long i) {
    long long st = 1, dr = kq, mij = 0;
    while(st <= dr) {
        mij = (st + dr) / 2;
        if(x > q[mij])       st = mij + 1;
        else                 dr = mij - 1;
    }
    q[st] = x, kq = max(kq, (long long)st), poz[++kp] = st;
}
int main()
{
    f >> N;
    for(long long i = 1; i <= N; i++) f >> a[i];
    for(long long i = 1; i <= N; i++)
        put(a[i], i);
    g << kq << "\n";
    for(int i = N; i >= 1; i--) if(poz[i] == kq) { kq--, ult = a[i], q[++SOL] = a[i], j = i-1; break; }
    for( ; kq >= 1; j--)
        if(poz[j] == kq && ult > a[j])
            q[++SOL] = a[j], kq--, ult = a[j];
    for(int i = SOL; i >= 1; i--) g << q[i] << " ";
    g << "\n";
    return 0;
}