#include <stdio.h>
#define VMAX 100005

using namespace std;

struct {
    int val;
    int best;
    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()
{
    int n, i; scanf("%d", &n);
    for (i = 1; i <= n; ++i) scanf("%d", &v[i].val);

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

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

        v[i].best = 1 + lengthsPos;
        v[i].next = lengths[lengthsPos].pos;

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

    printf("%d\n", lMax);

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

    return 0;
}