#include <cstdio>

int n, l, v[100005], last[100005], pred[100005], sol[100005];

int find(int x) {
   int st = 1, dr = l, m;
   while (st <= dr) {
      m = (st+dr) >> 1;
      if (v[last[m]] < x &&  v[last[m+1]] >= x)
        return m;
      if (v[last[m+1]] < x)
        st = m + 1;
      else
        dr = m - 1;
   }
   return l;
}

int main() {
    int i, pos, cnt = 0;
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    scanf("%d", &n);
    for(i = 1; i <= n; ++i)
        scanf("%d", &v[i]);

    for(i = 1; i <= n; ++i)
        if(v[i] < v[last[1]]) {
            pred[i] = 0;
            last[1] = i;
        }
        else if(v[i] > v[last[l]]) {
            pred[i] = last[l];
            last[++l] = i;
        }
        else {
            pos = find(v[i]);
            pred[i] = last[pos];
            last[pos+1] = i;
        }

    for(i = last[l]; i; i = pred[i])
        sol[++cnt] = v[i];

    printf("%d\n", l);
    for(i = cnt; i >= 1; --i)
        printf("%d ", sol[i]);
}