#include <bits/stdc++.h>
using namespace std;

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


int prev[100005], v[100005], lungime_subsir, n;
vector <int> sir;

int caut_bin(int element)
{
    int st = 0, dr = lungime_subsir, m;
    while(st != dr)
    {
        m = (st + dr)/2;
        if(v[sir[m]] < element)
            st = m + 1;
        else
            dr = m;
    }
    if(v[sir[st]] == element)
        st = -1;
    return st;
}

int main()
{
    int x, i, pos;
    fin >> n;
    for(i = 0; i < n; i++)
        fin >> v[i];
    sir.push_back(0), lungime_subsir = 0;
    for(i = 1; i < n; i++)
    {
        x = v[i];
        if(x < v[sir[0]])
            sir[0] = i;
        else if(x > v[sir[lungime_subsir]])
        {
            prev[i] = sir[lungime_subsir];
            lungime_subsir++;
            sir.push_back(i);
        }
        else
        {
            pos = caut_bin(x);
            if(pos != -1)
            sir[pos] = i;
            prev[i] = sir[pos - 1];
        }
    }
    fout << lungime_subsir + 1 << '\n';
    stack <int> solutii;
    solutii.push(sir[lungime_subsir]);
    for(i = lungime_subsir; i > 0; i--)
    {
        x = prev[sir[i]];
        solutii.push(x);
    }
    while(!solutii.empty())
        fout << v[solutii.top()] << ' ', solutii.pop();

    return 0;
}