#include <bits/stdc++.h>
using namespace std;
vector<int>v;
int poz[100005];
int a[100005];
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    int n,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%d",&a[i]);
    for(i=1;i<=n;i++)
    {
        if(v.empty())
        {
            v.push_back(a[i]);
            poz[i]=1;
            continue;
        }
        if(v[v.size()-1]<a[i])
        {
            v.push_back(a[i]);
            poz[i]=v.size();
            continue;
        }
        vector<int>::iterator it;
        it=lower_bound(v.begin(),v.end(),a[i]);
        v[it-v.begin()]=a[i];
        poz[i]=it-v.begin()+1;
    }
    cout<<v.size()<<endl;
    stack<int>st;
    int val=v.size();
    for(i=n;i>=1;--i)
        if(poz[i]==val)st.push(i),--val;
    while(!st.empty())
        cout<<a[st.top()]<<" ",st.pop();
    return 0;
}