#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int Nmax = 100005;

int n;
int a[Nmax];
int dp[Nmax], s[Nmax], p[Nmax];

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    dp[1] = 1;
    s[1] = a[1];
    p[1] = 1;
    int len = 1;
    for(int i = 2; i <= n; i++)
    {
        if(a[i] > s[len])
        {
            dp[i] = len+1;
            s[++len] = a[i];
            p[len] = i;
        }
        else
        {
            int ind = lower_bound(s+1, s+1+len, a[i])-s;
            s[ind] = a[i];
            p[ind] = i;
        }
    }
    fout << len << "\n";
    for(int i = 1; i <= len; i++)
        fout << s[i] << " ";
    return 0;
}