#include <fstream>
#include <stack>
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

#define DIM 100000

int n, k;
int a[DIM + 1], v[DIM + 1], position[DIM + 1];

//caut binar cel mai din stanga element a.i a[mid] >= x;
static inline int CautBinarSt(int x) {
  int st = 1, dr = k, poz = k + 1;
  while(st <= dr) {
    int mid = (st + dr) >> 1;
    if(x <= a[mid]) {
      poz = mid;
      dr = mid - 1;
    }else {
      st = mid + 1;
    }
  }
  return poz;
}

int main() {
  fin >> n;
  for(int i = 1; i <= n; i++)
    fin >> v[i];
  
  a[k = 1] = v[1];
  position[1] = 1;
  for(int i = 2; i <= n; i++) {
    int poz = CautBinarSt(v[i]);
    if(poz > k)
      k++;
    a[poz] = v[i];
    position[i] = poz;
  }

  stack <int> ans; 
  for(int i = n; i >= 1; i--)
    if(position[i] == k) {      //parcurg ce pozitii ocupa elementele in vectorul a;
      ans.push(v[i]);
      k--;
    }

  fout << ans.size() << '\n';
  while(!ans.empty()) {
    fout << ans.top() << " ";
    ans.pop();
  }

  return 0;
}