#include <bits/stdc++.h>

using namespace std;

int n, v[100001];
vector<int> a;

int binar(int x, int m) {

    if(a[m - 1] < x)
        return -1;

    int p = 0;
    for(int pas = m/2; pas; pas/=2) 
        while(p + pas < m && a[p + pas] <= x)
            p+=pas;

    if(a[p] < x)
        p++;
    
    return p;
  
} 

void solve() {
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n; i++)
        cin>>v[i];

    a.push_back(v[1]);

    for(int i = 2; i <= n; i++) {
        int pos = binar(v[i], a.size());

        if(pos == -1)
            a.push_back(v[i]);
        else
            a[pos] = v[i];
    }

    cout<<a.size()<<'\n';
    for(auto it : a)
        cout<<it<<' ';

    
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    solve();

    return 0;
}