#include <fstream>
#include <iostream>

using namespace std;

ifstream fi ("scmax.in");
//ifstream fi ("grader_test1.in");
ofstream fo ("scmax.out");
int n, nes, gasit, i, j, e, ind[100001], a[100001], p[100001], s[100001];

int caut (int v) { // valoarea cautata
  int s = 1, d = nes, m;
  do {
    m = (s + d) / 2;
    if (a[ind[m]] < v and v < a[ind[m+1]])
      return m + 1;
    else
      if (v < a[ind[m]])
        d = m - 1;
      else
        s = m + 1;
  } while (s <= d);
  return 1;
}

int main () {
  fi >> n;
  for (i = 1; i <= n; i++)
    fi >> a[i];
  nes = 1; ind[1] = 1; // nes - numarul de elemente din subsir
  for (i = 2; i <= n; i++) {
    if (a[i] > a[ind[nes]]) { // Subsirul creste.
      p[i] = ind[nes]; nes++; ind[nes] = i;
    }
    else { // Cautam cel mai mic element >= a[i], al carui pozitie a fost retinuta in ind
      gasit = caut(a[i]);
      //p[i] = p[ind[gasit]];
      p[i] = ind[gasit-1];
      ind[gasit] = i;
    }
/*
    cout << "i = " << i << endl;
    for (e = 1; e <= nes; e++)
      cout << ind[e] << ' ';
    cout << endl;
    for (e = 1; e <= nes; e++)
      cout << a[ind[e]] << ' ';
    cout << endl;*/
  }
  fo << nes << '\n';
  for (i = ind[nes], j = 1; j <= nes; i = p[i], j++)
    s[j] = a[i];
  for (i = nes; i >= 1; i--)
    fo << s[i] << ' ';
  return 0;
}