#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x); re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

template <class T> 
void wr(T x) {
    cout << x;
}

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}


inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    /* standard algorithm */
    const int INF = 2e9 + 1;
    int n; re(n);
    vt <int> v(n), dp(n + 1, INF), p(n + 1), a(n + 1, -1); 
    re(v); dp[0] = -INF;

    for (int i = 0; i < n; ++i) {
        int j = upper_bound(all(dp), v[i]) - dp.begin();
        if (dp[j - 1] < v[i] and v[i] < dp[j]) {
            dp[j] = v[i];
            p[i] = a[j - 1];
            a[j] = i;
        }
    }

    vt <int> res;
    for (int i = n; i >= 0; --i)
        if(dp[i] < INF) {
            wr(i, '\n');
            res.emb(v[a[i]]);
            for (int u = p[a[i]]; u != -1; u = p[u])
                res.emb(v[u]);

            reverse(all(res));
            wr(res);    
            return;      
        }

}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("scmax");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}