#include <fstream>
#define IN "scmax.in"
#define OUT "scmax.out"
#define NMAX 100001
using namespace std;

ifstream fin(IN);
ofstream fout(OUT);

int n,poz,in;
int A[NMAX],Scmax[NMAX];

void citire();
void pd();
void afisare();
int main()
{
    citire();
    pd();//subsirul crescator maximal care se termina in k
    afisare();
    return 0;
}

void citire()
{int i;
fin>>n;
for(i=1;i<=n;i++)
{
    fin>>A[i];
    Scmax[i]=1;
}

}


void pd()
{
int i,maxi=0;
for(i=2;i<=n;i++)
{
    if(A[i]>A[i-1]) {Scmax[i]=Scmax[i-1]+1;} else
    if(A[i]==A[i-1]) {Scmax[i]=Scmax[i-1];} else in=i;
    if(Scmax[i]>maxi) {maxi=Scmax[i];poz=i;}

}

}

void afisare()
{
int i;
fout<<Scmax[poz]<<'\n';
fout<<A[in];
//fout<<A[poz-Scmax[poz]+1];
for(i=in+1;i<=poz;i++)
    {
        if(A[i]!=A[i-1]) fout<<' '<<A[i];
    }
    fout<<'\n';
}


/*
70 pct

#include <fstream>
#define  IN "scmax.in"
#define OUT "scmax.out"
#define NMAX 100010
using namespace std;

ifstream fin(IN);
ofstream fout(OUT);

int A[NMAX],lg[NMAX],urm[NMAX],n;

void citire();
void rezolva();
void afisare();
int main()
{
    citire();
    rezolva();
    afisare();
    return 0;
}


void citire()
{
    int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>A[i];
}

void rezolva()
{
    int i,j;
    lg[n]=1;
    urm[n]=-1;
for(i=n;i>=1;i--)
{
    lg[i]=1;
    urm[i]=-1;
    for(j=i+1;j<=n;j++)
    if (A[i]<A[j] && lg[j]+1>lg[i]) {lg[i]=lg[j]+1;urm[i]=j;}
    //if (A[i]=A[j] && lg[j]>=lg[i]) {lg[i]=lg[j];urm[i]=j;}

}
}


void afisare()
{
int maxi=0,i,j;
for(i=1;i<=n;i++)
if(maxi<lg[i]) {maxi=lg[i];j=i;}
fout<<maxi<<'\n';

while(urm[j]!=-1)
{
i=j;
fout<<A[i]<<' ';
j=urm[i];
}
fout<<A[j]<<'\n';
}


*/