#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second

void solve(){
    int n;
    cin >> n;
    const int INF = 2e9+2;
    vi a(n), dp(n+1, INF), ind(n+1, -1), parent(n+1);
    dp[0] = -INF;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    for(int i = 0; i < n; i++){
        int j = upper_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        if(dp[j-1] < a[i] && a[i] < dp[j]){
            dp[j] = a[i];
            ind[j] = i;
            parent[i] = ind[j-1];
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        if(dp[i] != INF)
            ans = i;
    }
    int u = ind[ans];
    vi lis;
    while(u != -1){
        lis.pb(a[u]);
        u = parent[u];
    }
    cout << lis.size() << '\n';
    reverse(lis.begin(), lis.end());
    for(auto i : lis)
        cout << i << ' ';
    cout << '\n';
}  
 
int main(){
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}