#include <bits/stdc++.h>
using namespace std;
typedef int ll;
#define double long double;
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

ll n, dp[100005];

ifstream fin("scmax.in");
ofstream fout("scmax.out");

void solve()
{
    fin>>n;
    vector<ll> vec(n+1), prev(n+1, -1);
    for(ll i=0;i<n;i++)
        fin>>vec[i];
    for(ll i=0;i<n;i++)
        dp[i]=1;
    for(ll i=0;i<n;i++)
    {
        for(ll j=0;j<i;j++)
        {
            if(vec[i]>vec[j]){if(dp[i]<dp[j]+1){dp[i]=dp[j]+1;prev[i]=j;}}
        }
    }
    ll ans=0, pos=0;
    for(ll i=0;i<n;i++)
    {
        if(ans<dp[i]){ans=dp[i];pos=i;}
    }
    fout<<ans<<endl;
    vector<ll> rest;
    rest.pb(vec[pos]);
    pos=prev[pos];
    while(pos!=-1)
    {
        rest.pb(vec[pos]);
        pos=prev[pos];
    }
    for(auto i=rest.rbegin();i!=rest.rend();i++)
        fout<<*i<<' ';
}

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