#include <bits/stdc++.h>

using namespace std;

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

#define N_MAX 100005
#define INF 2000000001

int dp[N_MAX], v[N_MAX], prv[N_MAX], pos[N_MAX], arr[N_MAX];

int main()
{
  int n, i, l, res, pos1;
  fin >> n;
  pos[0] = -1;
  for(i = 0; i < n; ++i) {
    fin >> v[i];
    dp[i + 1] = INF;
    prv[i] = -1;
    pos[i + 1] = -1;
  }

  dp[0] = -INF;

  for(i = 0; i < n; ++i) {
    l = upper_bound(dp, dp + n + 1, v[i]) - dp;
    if(dp[l - 1] < v[i] && v[i] < dp[l]) {
      pos[l] = i;
      dp[l] = v[i];
      prv[i] = pos[l - 1];
    }
  }

  res = 0;
  for(i = 1; i <= n; ++i) {
    if(dp[i] != INF) {
      res = i;
    }
  }

  fout << res << '\n';

  i = pos[res];
  pos1 = 0;
  while(i != -1) {
    arr[pos1++] = v[i];
    i = prv[i];
  }

  for(i = pos1 - 1; i >= 0; --i) {
    fout << arr[i] << ' ';
  }
  fout << '\n';

  return 0;
}