/*
                    __
                   /\ \
 _ __   ___     ___\ \ \/'\     ___      __      ___     ___      __
/\`'__\/ __`\  /'___\ \ , <    / __`\  /'__`\  /' _ `\ /' _ `\  /'__`\
\ \ \//\ \L\ \/\ \__/\ \ \\`\ /\ \L\ \/\ \L\.\_/\ \/\ \/\ \/\ \/\ \L\.\_
 \ \_\\ \____/\ \____\\ \_\ \_\ \____/\ \__/.\_\ \_\ \_\ \_\ \_\ \__/.\_\
  \/_/ \/___/  \/____/ \/_/\/_/\/___/  \/__/\/_/\/_/\/_/\/_/\/_/\/__/\/_/


*/

#ifndef __AHA__HEADER
#define __AHA__HEADER

#include <bits/stdc++.h>
using namespace std;
#define g0 get<0>
#define g1 get<1>
#define g2 get<2>
#define ft first
#define sd second
#define sz(x) (i6) x.size()
#define psb(x) push_back(x)
#define ppb() pop_back()
#define bg(x) x.begin()
#define ed(x) x.end()
#define col(x) x.begin(), x.end()
#define srt(x) sort(x.begin(), x.end())

#define pq priority_queue
#define fn function
#ifdef LOCAL
#define git stauDBG_MACRO_NO_WARNING
#include <dbg.h>
#else
#define dbg(...)
#endif
#define endl '\n'

template <typename T>
using vec = vector<T>;
template <typename T>
using deq = deque<T>;
template <typename K, typename V>
using hmap = unordered_map<K, V>;

using str = string;
using vb = vec<bool>;

using byte = int8_t;
using i3 = int32_t;
using i6 = int64_t;
using i64 = int64_t;
using u3 = uint32_t;
using u6 = uint64_t;

using d6 = long double;

using p3 = pair<i3, i3>;
using vi3 = vec<i3>;
using vp3 = vec<p3>;

using p6 = pair<i6, i6>;
using vi6 = vec<i6>;
using vd6 = vec<d6>;
using vp6 = vec<p6>;
using vv = vec<vi6>;

using dp6 = deq<p6>;
using di6 = deq<i6>;

using mi6 = map<i6, i6>;
using mp6 = map<p6, i6>;
using si6 = set<i6>;
using hi6 = hmap<i6, i6>;

using bs = bitset<64>;

using graph = vv;
using matrix = vv;

const d6 EPS = 1 / 1000000.0;
const i6 ZERO = 0;
const i6 _0 = ZERO;
const i6 ONE = 1;
const i6 _1 = ONE;
const i6 INF = INT64_MAX / 4;
const i6 NINF = -INF;

namespace std {
template <typename T1, typename T2>
struct hash<pair<T1, T2>> {
  std::size_t operator()(const pair<T1, T2>& pair) const noexcept {
    return hash<T1>()(pair.first) ^ hash<T2>()(pair.second);
  }
};
}  // namespace std

template <typename T1, typename T2>
istream& operator>>(istream& stream, pair<T1, T2>& p) {
  stream >> p.ft;
  stream >> p.sd;
  return stream;
}

template <typename T1, typename T2>
ostream& operator<<(ostream& stream, const pair<T1, T2>& p) {
  return stream << p.ft << " " << p.sd;
}

template <typename T>
istream& operator>>(istream& stream, vec<T>& v) {
  if (v.empty()) {
    u6 len;
    stream >> len;
    v.assign(len, T());
  }
  for (auto i = 0; i < sz(v); i++) {
    stream >> v[i];
  }
  return stream;
}

template <typename T>
ostream& operator<<(ostream& stream, const vec<T>& v) {
  if (!v.empty()) {
    stream << v[0];
  }
  for (auto i = 1; i < sz(v); i++) {
    stream << " " << v[i];
  }
  return stream;
}

template <typename T>
istream& operator>>(istream& stream, deq<T>& v) {
  if (v.empty()) {
    u6 len;
    stream >> len;
    v.assign(len, T());
  }
  for (auto i = 0; i < sz(v); i++) {
    stream >> v[i];
  }
  return stream;
}

template <typename T>
ostream& operator<<(ostream& stream, const deq<T>& v) {
  if (!v.empty()) {
    stream << v[0];
  }
  for (auto i = 1; i < sz(v); i++) {
    stream << " " << v[i];
  }
  return stream;
}
#endif

struct elem {
  i64 len;
  i64 idx;

  bool operator<(const elem e) const { return (len < e.len); }
};

class ftree {
 private:
  vector<elem> ft;

  inline i6 lsbl(i6 x) { return x & (-x); }

 public:
  ftree(u6 n) : ft(n + 1, {0, -1}) {}

  inline void update(i6 i, elem val) {
    u6 crt = i + 1;
    while (crt < ft.size()) {
      ft[crt] = max(val, ft[crt]);
      crt += lsbl(crt);
    }
  }

  inline elem query(i6 from) {
    i6 crt = from + 1;
    elem mx = {0, -1};
    while (crt > 0) {
      mx = max(mx, ft[crt]);
      crt -= lsbl(crt);
    }
    return mx;
  }
};

i64 b_search(i64 val, vector<i64>& vs) {
  i64 l = 0;
  i64 r = vs.size() - 1;

  while (l <= r) {
    i64 mid = l + (r - l) / 2;

    if (vs[mid] == val) {
      return mid;
    } else if (vs[mid] < val) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }

  return l;
}

ifstream fin{"scmax.in"};
ofstream fout{"scmax.out"};

void print_sol(i64 ii, vector<i64>& v, vector<i64>& idx) {
  if (idx[ii] != -1) {
    print_sol(idx[ii], v, idx);
  }

  fout << v[ii] << " ";
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // #ifdef LOCAL
  // #endif

  i64 n;
  fin >> n;

  ftree f(n);

  vector<i64> v(n);
  vector<i64> vs(n);
  for (i64 i = 0; i < n; i++) {
    fin >> v[i];
    vs[i] = v[i];
  }
  sort(vs.begin(), vs.end());

  vector<i64> vn(n);
  for (i64 i = 0; i < n; i++) {
    vn[i] = b_search(v[i], vs);
  }

  vector<i64> l(n);
  vector<i64> idx(n);
  for (i64 i = 0; i < n; i++) {
    elem crt = f.query(vn[i] - 1);
    l[i] = 1 + crt.len;
    idx[i] = crt.idx;

    f.update(vn[i], {l[i], i});
  }

  i64 mx = 0;
  i64 ii = 0;
  for (i64 i = 0; i < n; i++) {
    if (mx < l[i]) {
      mx = l[i];
      ii = i;
    }
  }

  fout << mx << '\n';
  print_sol(ii, v, idx);

  return 0;
}