#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

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

#define N 100000

void LCS(int v[], int n) {
  int best[N];
  int pre[N];
  for (int i = 0; i < n; i++) {
    int max = 0;
    for (int j = i; j >= 0; j--) {
      if (best[j] > max && v[i] > v[j]) {
        max = best[j];
      }
    }
    if (max != 0) {
      best[i] = max + 1;
    } else {
      best[i] = 1;
    }
  }
  int k = best[n - 1];
  fout << k << '\n';
  int l = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (best[i] == k) {
      pre[l++] = v[i];
      k--;
    }
  }

  for (int i = l - 1; i >= 0; i--) {
    fout << pre[i] << ' ';
  }
}

int main() {
  int v[N], n;
  fin >> n;
  for (int i = 0; i < n; i++) {
    fin >> v[i];
  }
  LCS(v, n);
  return 0;
}