#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int maxn = 100005;
vector <int> aux;
int f[maxn];
int w[maxn];
int d[maxn];
int v[maxn];
int n;
inline int cautbin(int x, int k)
{
    int st = 1;
    int dr = k;
    int ret = -1;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if( v[w[mij]] < x)
            st = mij + 1;
        else
            dr = mij - 1;
        ret = st;
    }
    return ret;
}

int main()
{
    in >> n;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    int k = 1;
    d[1] = 1;
    w[1] = 1;
    for(int i = 2; i <= n; i++)
    {
        if(v[i] > v[w[k]])
        {
            k++;
            w[k] = i;
            f[i] = w[k - 1];
            d[i] = k;
        }
        else
        {
            int p = cautbin(v[i], k);
            d[i] = p;
            f[i] = w[p-1];
            w[p] = i;
        }
    }
    out << k << "\n";
    int x = 0;
    for(int i = 1; i <= n; i++)
        if(d[i] == k)
            x = i;
    while(x != 0)
    {
        aux.push_back(x);
        x = f[x];
    }
    reverse(aux.begin(), aux.end());
    for(auto it : aux)
        out << v[it] << " ";
    out << "\n";
    return 0;
}