#include <iostream>
#include <fstream>
#include <cstring>
#include <stack>

using namespace std;

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

const int INF = 1e9;
int n, m;
int v[100100], best[100100], previous[100100], small[100100];
stack<int> ans;

int binarySearch(int value, int left, int right)
{
    int mid;

    while(left <= right)
    {
        mid = (left + right) / 2;

        if(v[small[mid]] < value)
            left = mid + 1;
        else
            right = mid - 1;
    }

    return left;
}

int main()
{
    in >> n;

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

    v[0] = INF;

    small[1] = 1;
    previous[1] = -1;
    best[1] = 1;

    for(int i = 2; i <= n; i++)
    {
        int x = binarySearch(v[i], 1, i - 1);

        best[i] = x;
        previous[i] = x;

        if(best[previous[x]] == best[x])
            previous[x] = previous[previous[x]];

        if(v[small[best[i]]] > v[i])
            small[best[i]] = i;

        if(best[i] > best[m])
            m = i;
    }

    out << best[m] << '\n';

    while(m != -1)
    {
        ans.push(v[m]);
        m = previous[m];
    }

    while(!ans.empty())
    {
        out << ans.top() << ' ';
        ans.pop();
    }

    return 0;
}