#include <bits/stdc++.h>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
const int Nmax = 100005;
int lis[Nmax] , a[Nmax] , n , m , poz[Nmax] , sol[Nmax] , k;
/**
    poz[i] - > lungimea maxima a unui subsir strict crescator ce se termina in pozitia i
*/
/// caut cea mai din stanga pozitie p a . i lis[p] >= x
inline int Binary_Search(int x)
{
    int st = 1 , dr = m , mij , poz = 0;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(lis[mij] >= x)
        {
            poz = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return poz;
}
int main()
{
    int x;
    fin >> n;
    for(int i = 1 ; i <= n ; i++)
        fin >> a[i];
    m = 1;
    lis[m] = a[1];
    poz[m] = 1;
    for(int i = 2 ; i <= n ; i++)
    {
        x = a[i];
        if(x <= lis[1])
        {
            lis[1] = x;
            poz[i] = 1;
        }
        else if(x > lis[m])
        {
            ++m;
            lis[m] = x;
            poz[i] = m;
        }
        else
        {
            lis[Binary_Search(x)] = x;
            poz[i] = Binary_Search(x);
        }
    }
    fout << m << "\n";
    int mx = LONG_MAX , t = m;
    for(int i = n ; i >= 1 ; i--)
        if(t == poz[i] && mx >= a[i])
    {
        t--;
        mx = a[i];
        sol[++k] = a[i];
    }
    for(int i = k ; i >= 1 ; i--)
        fout << sol[i] << " ";
    fout << "\n";
    fin.close();
    fout.close();
    return 0;
}