#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ld long double
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define ass assign
#define fun function

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...)                                                                                     \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=((ll)n); i>=1; --i)
#define per2e(i,n) for(ll i=((ll)n); i>=1; --i)
#define per3e(i,a,b) for(ll i=((ll)a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=((ll)a); i>=(ll)(b); i-=(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))
// #define forit(v) for (auto it = v.begin(); it != v.end(); it++)
// #define forit2(it, v) for (auto it = v.begin(); it != v.end(); it++)
// #define forrit(v) for (auto it = v.rbegin(); it != v.rend(); it++)
// #define forrit2(it, v) for (auto it = v.rbegin(); it != v.rend(); it++)

// #ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
// #else
// #define bug(...) 777771449
// #endif

const ll MOD = 1e9 + 7;
const ll INF = (1ll << 59);

const string FILENAME = "scmax";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

#define cin fin
#define cout fout

vec<ll> parent;

class Hoshino
{
public:

	ll n;
	vec<pll> ai;
	
	bool cmp(const pll& a, const pll& b)
	{
		if(a.fi != b.fi) return a.fi > b.fi;
		return a.se < b.se;
	}
	void build(ll x)
	{
		n=x;
		ai.ass(2*n-1, {0,-1});
	}
	pll calc(ll i, ll l, ll r){return {(l+r)/2,i+2*((l+r)/2-l+1)};}
	void update(ll x, pll val)
	{
		fun<void(ll,ll,ll)>update_([&](ll i, ll l, ll r)
		{
			if(l==r)
			{
				if(cmp(val,ai[i])) ai[i]=val;
				return;
			}
			
			ll mid,rc;tie(mid,rc)=calc(i,l,r);
			if(x<=mid)update_(i+1,l,mid);
			else update_(rc,mid+1,r);
			
			if(cmp(ai[i+1],ai[rc])) ai[i]=ai[i+1];
			else ai[i]=ai[rc];
		});
		update_(0,0,n-1);
	}
	pll query(ll x, ll y)
	{
		pll best = {0,-1};
		fun<void(ll,ll,ll)>query_([&](ll i, ll l, ll r)
		{
			if(x<=l && r <= y)
			{
				if(cmp(ai[i],best)) best=ai[i];
				return;
			}
			
			ll mid,rc;tie(mid,rc)=calc(i,l,r);
			if(x<=mid) query_(i+1,l,mid);
			if(mid<y)query_(rc,mid+1,r);
		});
		query_(0,0,n-1);
		
		return best;
	}
};

class Sift
{
public:

	ll n;
	vec<ll> vals;
	Hoshino ids;
	
	void build(vec<ll>&v)
	{
		vals=v;
		sort(all(vals));
		vals.erase(unique(all(vals)),vals.end());
		n=vals.size();
		ids.build(n);
	}
	ll ind(ll val){return lower_bound(all(vals),val)-vals.begin();}
	void update(ll val, pll fortnite)
	{
		ids.update(ind(val), fortnite);
	}
	pll query(ll val)
	{
		ll pos = ind(val);
		if(pos==0)return {0,-1};
		return ids.query(0, pos-1);
	}
};

int main()
{
	ll n;
	cin >> n;
	vec<ll> v(n); rep(n) cin >> v[i];
	
	Sift sift;
	sift.build(v);
	
	ll maxlen = 0, maxlenInd = -1;
	parent.ass(n,-1);
	
	rep(n)
	{
		pll best = sift.query(v[i]);
		parent[i] = best.se;
		
		if(best.fi+1 > maxlen)
		{
			maxlen = best.fi+1;
			maxlenInd=i;
		}
		sift.update(v[i], {best.fi+1, i});
	}
	
	cout << maxlen << nl;
	vec<ll> ans;
	ans.reserve(n);
	while(maxlenInd != -1)
	{
		ans.pb(v[maxlenInd]);
		maxlenInd=parent[maxlenInd];
	}
	
	per(ans.size()) cout << ans[i] << ' ';
	
    return 0;
}