#include <bits/stdc++.h>

#define N 100005

using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n;
int t[N], d[N], arr[N];

void read() {
  f>>n;
  for(int i = 1;i <= n;++i) {
    f>>arr[i];
  }
}

void reconstruct(int i) {
  if(t[i]) {
    reconstruct(t[i]);
  }
  g<<arr[i]<<" ";
}

void solve() {
  int len = 1;
  d[1] = 1;
  for(int i = 2;i <= n;++i) {
    int left = 1, right = len;
    while(left <= right) {
      int mid = (left + right) >> 1;
      if(arr[d[mid]] >= arr[i]) {
        right = mid - 1;
      }
      else {
        left = mid + 1;
      }
    }
    if(left > len) {
      ++len;
      d[len] = i;
      t[i] = d[len - 1];
    }
    else {
      d[left] = i;
      t[i] = d[left - 1];
    }
  }
  g<<len<<'\n';
  reconstruct(d[len]);
}

int main() {
  read();
  solve();
  return 0;
}