#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#endif // TEST


int n,a[100001];
int f[100001],b[100001];

int main()
{
    fin>>n;

    for (int i=0; i<=n; i++)
    {
        fin>>a[i];
    }

    int answer=0;
    for (int i=0; i<=n; i++){
      f[i]=lower_bound(b+1, b+answer+1, a[i])-b;
      answer=max(answer,f[i]);
      b[f[i]]=a[i];
   }

   fout<<answer<<'\n';

    int require = answer;
    vector<int> T;
   for (int i=n; i>=1; i--)
   if (f[i]==require){
      T.push_back(a[i]);
      require--;
   }
   reverse(T.begin(), T.end());

   for (int i=0; i<T.size(); i++)
   fout<<T[i]<<' ';


    return 0;
}