#include <cstdio>

using namespace std;

const int nmx = 100002;

int n;
int v[nmx];
int val[nmx],ant[nmx],pos[nmx];
int maxx = -1, poss;

void citire()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &v[i]);
}

void rezolvare()
{
    val[0] = 1;
    val[1] = 1;

    for(int i = 2; i <= n; ++i)
    {
        if(v[i] > v[val[val[0]]])
        {
            ++ val[0];
            val[val[0]] = i;
            ant[i] = val[val[0]-1];
            poss = i;
        }
        else
        {
            int st = 1, dr = val[0];

            while(st <= dr)
            {
                int mij = (st + dr) / 2;
                if(v[i] < v[val[mij]] && v[i] > v[val[mij]-1])
                {
                    if(mij - 1 > 1)
                    ant[i] = val[mij-1];
                    else
                        ant[i] = 0;
                    val[mij] = i;
                    break;
                }
                else if(v[i] > v[val[mij]])
                    st = mij + 1;
                else
                    dr = mij - 1;
            }
        }
    }
}

void rec(int p)
{
    if(p)
    {
        rec(ant[p]);
        printf("%d ", v[p]);
    }
}

void afish()
{
    printf("%d\n", val[0]);

    rec(poss);
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    citire();
    rezolvare();
    afish();
    return 0;
}