#include<cstdio>
#define MAX_N 100000
using namespace std;

int v[MAX_N], T[MAX_N + 1], R[MAX_N + 1], n, len;
FILE *fout = fopen("scmax.out","w");

void Read()
{
    FILE *fin = fopen("scmax.in","r");
    fscanf(fin,"%d",&n);
    for(int i=0; i<n; i++)
    {
        fscanf(fin,"%d",&v[i]);
        R[i] = -1;
    }
    fclose(fin);
}

int binarySearch(int End, int val)
{
    int left, right, mid;
    left = 0; right = End;
    while(left <= right)
    {
        mid = (left + right) >> 1;
        if(v[T[mid]] < val && val <= v[T[mid+1]])
            return mid + 1;
        else if(v[T[mid]] > val)
            right = mid - 1;
        else left = mid + 1;
    }
    return -1;
}

void longestIncreasingSubsequence()
{
    int index;
    T[0] = len = 0;
    for(int i=1; i<n; i++)
    {
        if(v[i] > v[T[len]])
        {
            len++;
            T[len] = i;
            R[T[len]] = T[len-1];
        }
        else if(v[i] < v[T[0]])
            T[0] = i;
        else
        {
            index = binarySearch(len,v[i]);
            T[index] = i;
            R[T[index]] = T[index-1];
        }
    }
}

void WriteSol(int x)
{
    if(x != -1)
    {
        WriteSol(R[x]);
        fprintf(fout,"%d ",v[x]);
    }
}

int main()
{
    Read();
    longestIncreasingSubsequence();
    fprintf(fout,"%d\n",len+1);
    WriteSol(T[len]);
    fprintf(fout,"\n");
    fclose(fout);
    return 0;
}