#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define double long double
#define endl '\n'
#define sz size
#define pb push_back
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
int const INF = LONG_LONG_MAX;

int n, a[100005];

void solve()
{
    ifstream cin("scmax.in");
    ofstream cout("scmax.out");
    int n;
    cin>>n;
    vector<int> dp, pos(n+5), pr(n+5);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        int it=lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        if(it==(int)dp.sz())
        {
            if(it==0){pr[i]=0;}else{pr[i]=pos[it-1];}
            dp.pb(a[i]);
            pos[it]=i;
        }
        else
        {
            if(it==0){pr[i]=0;}else{pr[i]=pos[it-1];}
            dp[it]=a[i];
            pos[it]=i;
        }
    }
    cout<<dp.sz()<<endl;
    vector<int> ans;
    int ind=pos[dp.sz()-1];
    while(ind!=0)
    {
        ans.pb(a[ind]);
        ind=pr[ind];
    }
    for(int i=ans.sz()-1;i>=0;i--)
        cout<<ans[i]<<' ';
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}