#include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define ll long long
#define INF INT_MAX
using namespace std;
ifstream fin( "scmax.in" );
ofstream fout( "scmax.out" );
void fast()
{
    cin.tie( 0 );
    ios_base::sync_with_stdio( 0 );
}
int n;
int a[100005];
int best[1000005], v = 0;
vector<int>sol;
int ok( int pos, int x )
{
    if( best[pos] >= x )
        return 0;

    return 1;
}
int cauta( int x )
{
    int l = 0, r = v + 1;

    while( r - l > 1 )
        {
            int mid = ( l + r ) / 2;

            if( ok( mid, x ) )
                l = mid;
            else
                r = mid;
        }

    return r;
}
int main()
{
    fast();
    fin >> n;

    for( int i = 1; i <= n; i++ )
        fin >> a[i];

    for( int i = 1; i <= n; i++ )
        best[i] = INF;

    best[1] = a[1];
    v = 1;

    for( int i = 2; i <= n; i++ )
        {
            int pos = cauta( a[i] );
            best[pos] = min( best[pos], a[i] );
            v = max( v, pos );
        }

    fout << v << '\n';

    for( int i = n; i >= 1, v > 0; i-- )
        if( a[i] >= best[v] && a[i] < best[v + 1] )
            {
                sol.pb( a[i] );
                v--;
            }

    reverse( sol.begin(), sol.end() );

    for( auto it : sol )
        fout << it << ' ';

    return 0;
}