#include<fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
pair<int,int> p[100105];
int v[100105], k[100105], i , n, j;
int main()
{
    fin>>n;
    for ( i = 1 ; i <= n ; i++ )
        fin>>v[i];
    for ( i = 1 ; i <= n ; i++ )
        p[i].first=2000000009;

    for ( i = 1 ; i <= n ; i++ )
        for ( j = 1 ; j <= n ; j++ )
            if( v[i] <= p[j].first )
            {
                p[j].first = v[i];
                p[j].second=i;
                break;
            }
    n=1;
    while( p[n].first != 2000000009 )
        n++;
    fout<<n-1<<"\n";
    for( i = 1 ; i <= n-1 ; i++ )
        fout<<p[i].first<<' ';

    fin.close();
    fout.close();
    return 0;
}