#include <stdio.h>
#define MAX_N 100000
#define INFINIT 2000000001

int best[MAX_N];
int s[1+MAX_N];

int bsearch(int st, int dr, int val) {
  int mid;
  while(dr - st > 1) {
    mid = (st + dr) / 2;
    if(s[mid] < val)
      st = mid;
    else
      dr = mid;
  }
  return st;
}

int main() {
  int n, max, i, x;
  FILE *fin = fopen("scmax.in", "r");
  fscanf(fin, "%d", &n);
  for(i = 0; i <= n; i++)
    s[i] = INFINIT;
  max = 0;
  for(i = 0; i < n; i++) {
    fscanf(fin, "%d", &x);
    best[i] = bsearch(0 , max + 1, x) + 1;
    if(best[i] > max)
      max = best[i];
    if(x < s[best[i]])
      s[best[i]] = x;
  }
  fclose(fin);

  FILE *fout = fopen("scmax.out", "w");
  fprintf(fout, "%d\n", max);
  for(i = 1; i <= max; i++)
    fprintf(fout, "%d ", s[i]);
  fclose(fout);
  return 0;
}