#include <bits/stdc++.h>
#define INF 2140000000
#define MaxT 132000
#define MaxN 50005
#define MAX 131072

using namespace std;
const int NMAX = 100010;

FILE *IN, *OUT;

struct T{
    int Max, Pos;
}tree[3 * NMAX], ans;

int N, M, ansmax, anspos, j;
int v[NMAX], s[NMAX], p[NMAX], scmax[NMAX];

int pos, out, sign;
char f[MAX], Out[MAX], str[10], c;

inline void Write_Ch(char ch){
    Out[out++] = ch;
    if(out == MAX)
        fwrite(Out, MAX, 1, OUT), out = 0;
}

inline void Write_Int(int nr){
    int x = 0;
    if(nr < 0) Write_Ch('-'), nr =- nr;
    do{
        str[x++] = nr % 10 + '0';
        nr /= 10;
    }
    while(nr);
    while(x > 0)
        Write_Ch(str[--x]);
}

inline void Read(int &nr){
    sign = 0;
    nr = 0;
    while(f[pos] < '0' || f[pos] > '9'){
        if(f[pos] == '-') sign=1;
        pos++;
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    while(f[pos] >= '0' && f[pos] <= '9'){
        nr = 10 * nr + f[pos++] - '0';
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    if(sign) nr =- nr;
}

int afisvector(int v[NMAX], int N){
    for(int i = 1; i <= N; i++)
        Write_Int(v[i]), Write_Ch(' ');
    Write_Ch('\n');
}

int binsearch(int st, int nd, int val){
    int mid, last;
    while(st <= nd){
        mid = (st + nd) / 2;
        if(val <= s[mid])
            nd = mid - 1, last = mid;
        else
            st = mid + 1;
    }

    return last;
}

int Query(int node, int st, int nd, int A, int B){
    if(A <= st && nd <= B){
        if(tree[node].Max > ans.Max){
            ans.Max = tree[node].Max;
            ans.Pos = tree[node].Pos;
        }
    } else {
        int mid = (st + nd) / 2;
        if(mid + 1 <= B)
            Query(2 * node + 1, mid + 1, nd, A, B);
        if(A <= mid)
            Query(2 * node, st, mid, A, B);
    }
}

int Update(int node, int st, int nd, int pos, int val, int i){
    if(st == nd){
        tree[node].Max = val;
        tree[node].Pos = i;
    } else {
        int mid = (st + nd) / 2;
        if(pos <= mid) Update(2 * node, st, mid, pos, val, i);
        else Update(2 * node + 1, mid + 1, nd, pos, val, i);
        if(tree[2 * node].Max > tree[2 * node + 1].Max)
            tree[node].Max = tree[2 * node].Max, tree[node].Pos = tree[2 * node].Pos;
        else
            tree[node].Max = tree[2 * node + 1].Max, tree[node].Pos = tree[2 * node + 1].Pos;
    }
}

int ansscv(int j){
    if(s[j] != j)
        ansscv(s[j]);
    Write_Int(scmax[j]); Write_Ch(' ');
}

int main(){

    IN = fopen("scmax.in", "r");
    OUT = fopen("scmax.out", "w");

    Read(N);
    for(int i = 1; i <= N; i++)
        Read(v[i]), s[i] = v[i], scmax[i] = v[i];
    sort(s + 1, s + N + 1);
    for(int i = 1; i <= N; i++)
        if(s[i] != s[M]) s[++M] = s[i];
    for(int i = 1; i <= N; i++)
        v[i] = binsearch(1, M, v[i]);

    for(int i = 1; i <= N; i++){
        ans.Max = 0; ans.Pos = i;
        if(v[i] - 1 > 0) Query(1, 1, N, 1, v[i] - 1);
        p[v[i]] = max(p[v[i]], 1 + ans.Max);
        s[i] = ans.Pos;
        if(p[v[i]] > ansmax) ansmax = p[v[i]], anspos = i;
        Update(1, 1, N, v[i], p[v[i]], i);
    }
    Write_Int(ansmax); Write_Ch('\n');
    ansscv(anspos);

    if(out > 0) fwrite(Out, 1, out, OUT);

    return 0;
}