#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)
#define repa(i, l, r) for (int i = l; i < r; i++)
#define repd(i, r, l) for (int i = r; i > l; i--)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int Nmax = 100555;
const int INF = 2000333999; // 2*10**9
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");

int a[Nmax], dp[Nmax], pos[Nmax], parent[Nmax];
int main(void) {
  int N;
  fin >> N;
  rep(i, N) { fin >> a[i]; }
  rep(i, N+1) { dp[i] = INF;}
  dp[0] = -1;

  rep(i, N+1) { pos[i] = -1; }
  int count = 0;
  for(int i = 0; i < N; i++) {
    int k = int(upper_bound(dp, dp + N + 1, a[i]) - dp);
    if (dp[k-1] < a[i] && a[i] < dp[k]) {
      dp[k] = a[i];
      pos[k] = i;
      parent[i] = pos[k-1];
      count = max(k, count);
    }
  }

  fout << count << '\n';

  vi subsequence;

  int i = pos[count];
  while(i > -1) {
    subsequence.push_back(a[i]);
    i = parent[i];
  }

  reverse(subsequence.begin(), subsequence.end());
  for(int x: subsequence) {
    fout << x << ' ';
  }
  fout << endl;

  return 0;
}