#include <bits/stdc++.h>

using namespace std;

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

int binar(int x) {

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

    if(p == 0 && a[p] < x || a[m - 1] < x)
    
        return -1;
    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[m++] = v[1];
    for(int i = 2; i <= n; i++) {
        int pos = binar(v[i]);

        if(pos == -1)
            a[m++] = v[i];
        else 
            a[pos] = v[i];

    }

    cout<<m<<'\n';
    for(int i = 0; i < m; i++)
        cout<<a[i]<<' ';
}

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

    solve();

    return 0;
}