#include <bits/stdc++.h>
#define VMAX (int)(1e5 + 5)

using namespace std;

int n, bestLengthPos;

struct {
    int val;
    int next;
} v[VMAX];

struct {
    int val;
    int pos;
} lengths[VMAX];

int binarySearch(int left, int right, int val) {
    if (left > right) return 0;

    int mid = (left + right) / 2;
    if (lengths[mid].val > val && lengths[mid+1].val <= val) return mid;

    if (lengths[mid+1].val > val) return binarySearch (mid + 1, right, val);
    else return binarySearch (left, mid - 1, val);
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &v[i].val);

    v[n].next = 0;
    lengths[1].val = v[n].val; lengths[1].pos = n;
    int lMax = 1, iMax = n;

    for (int i = n-1; i >= 1; --i) {
        bestLengthPos = binarySearch(1, lMax, v[i].val);
        if (bestLengthPos == lMax)
            ++lMax, iMax = i;

        v[i].next = lengths[bestLengthPos].pos;
        if (v[i].val > lengths[bestLengthPos+1].val)
            lengths[bestLengthPos+1].val = v[i].val, lengths[bestLengthPos+1].pos = i;
    }

    printf("%d\n", lMax);
    for (int i = iMax; ; i = v[i].next) {
        printf("%d ", v[i].val);
        if (v[i].next == 0) {
            printf("\n");
            break;
        }
    }

    return 0;
}