#include <bits/stdc++.h>

using namespace std;

int n, m, v[100001], a[100001];

int caut_bin(int x) {
    if(x > a[m])
        return -1;

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

    return p + 1;
}

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[++m] = v[1];
    for(int i = 2; i <= n; i++) {
        int pos = caut_bin(v[i]);
        if(pos == -1)
            a[++m] = v[i];
        else if(a[pos] > v[i])
            a[pos] = v[i];
        else if(pos == 0)
            a[1] = v[i];
    }
    cout<<m<<'\n';
    for(int i = 1; i<=m; i++)
        cout<<a[i]<<' ';
    
}

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

    solve();

    return 0;
}