#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define lsb(x) ((x) & (-x))
#define hmap unordered_map
#define var auto &
#define hset unordered_set
#define pq priority_queue
#define exists(x, v) (v.find(x) != v.end())
#define inrange(x, a, b) (x >= a && x <= b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef pair<ull, ull> p64_u;
typedef vector<int> v32;
typedef vector<ll> v64;
typedef vector<double> v64_d;
typedef vector<ull> v64_u;
typedef vector<p32> vp32;
typedef vector<p64> vp64;
typedef vector<p64_u> vp64_u;
typedef vector<pdd> vpdd;
typedef vector<string> vstr;
typedef vector<vector<int>>  vv32;
typedef vector<v64> vv64;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef HOME
    ~debug() { cerr << endl; }
    eni(!= ) cerr << boolalpha << i; ris;
}
eni(== ) ris << range(begin(i), end(i));
}
sim, class b dor(pair < b, c > d) {
    ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";

}

#else
    sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define darr(x,n) debug() <<#x<<": "<< range(x,x+n+1)
#define dmat(x, n, m) for (int i = 0; i <= n; i++) if (!i) debug() << #x << ":" << range(x[i], x[i] + m + 1); else debug() << range(x[i], x[i] + m + 1);

const int lim = 1e5 + 5;

p32 a[lim];
int a1[lim], d[lim];
int aint[4 * lim];
int n;

void update_tree(int idx, int l, int r, int pos, int val)
{
    if (pos < l || pos>r)
        return;

    if (l == r)
    {
        aint[idx] = val;
        return;
    }
    int m = (l + r) >> 1;
    update_tree(idx << 1, l, m, pos, val);
    update_tree(idx << 1 | 1, m + 1, r, pos, val);
    aint[idx] = max(aint[idx << 1], aint[idx << 1 | 1]);
}

int find_max(int idx, int l, int r, int ql, int qr)
{
    if (l > qr || r < ql)
        return 0;
    if (l >= ql && r <= qr)
        return aint[idx];
    int m = (l + r) >> 1;
    return max(find_max(idx << 1, l, m, ql, qr), find_max(idx << 1 | 1, m + 1, r, ql, qr));
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].first;
        a[i].second = i;
        a1[i] = a[i].first;
    }

    sort(a + 1, a + n + 1, [](p32 a, p32 b) {
        if (a.first == b.first)
            return a.second > b.second;
        return a.first < b.first;
    });

    int hmax = -1;
    int poz = -1;
    for (int i = 1; i <= n; i++)
    {
        int val = find_max(1, 1, n, 1, a[i].second - 1) + 1;
        update_tree(1, 1, n, a[i].second, val);
        if (val > hmax)
        {
            hmax = val;
            poz = a[i].second;
        }
        d[a[i].second] = val;
    }

    vector<int> sol;
    for (int i = poz; i >= 1; i--)
        if (d[i] == hmax)
        {
            sol.push_back(i);
            hmax--;
        }

    cout << aint[1] << '\n';
    for (int i = sol.size() - 1; i >= 0; i--)
        cout << a1[sol[i]] << " ";

    return 0;
}