#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;
#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;

int n;
vector<int> a, a1, sol;
int aib[lim];

int query(int idx)
{
    int ans = 0;
    for (int i = idx; i > 0; i -= lsb(i))
        ans = max(ans, aib[i]);
    return ans;
}

int update(int idx)
{
    int val = query(idx - 1) + 1;

    for (int i = idx; i <= n; i += lsb(i))
    {
        aib[i] = max(aib[i], val);
    }

    return val;
}

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++)
    {
        int x;
        cin >> x;
        a.push_back(x);
    }

    vector<int> d = a;
    sort(d.begin(), d.end());
    d.resize(unique(d.begin(), d.end()) - d.begin());
    for (int i = 0; i < n; ++i) {
        a[i] = lower_bound(d.begin(), d.end(), a[i]) - d.begin() + 1;
    }

    a1.resize(n);
    for (int i = 0; i < n; i++)
        a1[i] = update(a[i]);

    int max_len = query(n);
    cout << max_len << "\n";

    for (int i = n - 1; i >= 0; i--)
        if (a1[i] == max_len)
        {
            max_len--;
            sol.push_back(d[a[i]]);
        }
    for (int i = sol.size() - 1; i >= 0; i--)
        cout << sol[i] << " ";

    return 0;
}