#include <fstream>
#include <vector>
using namespace std;

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

int n, a[100005], p[100005], log = 1;
vector<int> v;

void read()
{
    f>>n;
    for (int i = 0; i < n; ++i) {
        f>>a[i];
    }
}

int binarySearch(int x)
{
    while(v.size() >= log)
        log<<=1;

    int lg = log;
    int i = -1;
    for(; lg; lg>>=1)
        if(i + lg < v.size() && x > v[i+lg])
            i+=lg;
    return i+1;
}

void solve()
{
    for (int i = 0; i < n; ++i) {
        int poz = binarySearch(a[i]);
        p[i] = poz;
        if(poz >= v.size())
            v.push_back(a[i]);
        else
            v[poz] = a[i];
    }
}

void print()
{
    int maxim = v.size()-1;
    vector<int> sol;
    g<<v.size()<<"\n";
    for (int i = n-1; i >= 0; --i) {
        if(p[i] == maxim)
        {
            sol.push_back(a[i]);
            maxim--;
        }
    }
    for(int i = sol.size()-1; i>=0; --i)
    {
        g<<sol[i]<<" ";
    }
}

int main() {
    ios::sync_with_stdio(false);
    read();
    solve();
    print();
    return 0;
}