#include <iostream.h>
#include <stdio.h>

long int v[100001],n,primu,i,j;
struct 
       {long int adr,val;} best[100001],maxbest;


int main()
    {freopen("scmax.in","r",stdin);freopen("scmax.out","w",stdout);
    scanf("%ld",&n);
    for(i=1;i<=n;i++)        scanf("%ld",&v[i]);
    for(i=1;i<=n;i++)
            {best[i].val=1;maxbest.val=0;maxbest.adr=0;
            for(j=1;j<i;j++)
                      if(best[j].val>maxbest.val && v[j]<v[i])
                                    {maxbest.val=best[j].val;maxbest.adr=j;}
            best[i].val+=maxbest.val;best[i].adr=maxbest.adr;
            }
   for(i=2,maxbest=best[1];i<=n;i++)
         if(maxbest.val<best[i].val)
                     {maxbest=best[i];primu=i;}
   printf("%ld\n%ld",maxbest.val,best[primu].val);
   while(maxbest.adr!=0)
               {printf("%ld ",best[maxbest.adr].val);
               maxbest=best[maxbest.adr];
               }
   printf("\n");
   fclose(stdin);fclose(stdout);
   return 0;}