#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");

const long long maxval = 2*1e9+1;

int main()
{
	int n;
    f >> n;
    long long v[n+1], d[n+1], prev[n+1];
    d[0] = 0;
    v[0] = -maxval;
    v[n+1] = maxval;
    for( int i = 1; i <= n; ++i )
    {
        f >> v[i];
        d[i] = n+1;
        prev[i] = 0;
    }
    int maxl = 0;
    for( int i = 1; i <= n; ++i )
    {
        int st = 1, dr = i, mij, ans = -1;
        while( st < dr )
        {
            /*
            st mij-1 mij mij+1 dr
            
            */
            mij = st+(dr-st)/2;
            if( v[ d[mij] ] < v[i] )
                st = mij+1;
            if( v[ d[mij] ] == v[i] )
                break;
            else if( v[ d[mij] ] > v[i] )
            {
                ans = mij;
                dr = mij-1;
            }
        }
        if( ans != -1 )
        {
            d[ans] = i;
            prev[i] = d[ans-1];
            maxl = max( maxl, ans );
        }
    }
    int curent = d[maxl];
    g << maxl << "\n";
    vector<long long> ans;
    while( prev[curent] > 0 )
    {
        ans.push_back(v[ curent ]);
        curent = prev[curent];
    }
    ans.push_back(v[ curent ]);
    for( int i = ans.size()-1; i >= 0; --i )
        g << ans[i] << " ";
    return 0;
}