#include <stdio.h>

using namespace std;
int a[100],l[100],max,i,j,n,lm;
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);

    l[n]=1;
    for(i=n-1;i>=1;i--){
        max=0;
        for(j=i+1;j<=n;j++)
            if(a[i]<a[j]&&l[j]>max)
            max=l[j];
        l[i]=max+1;
        if(l[i]>lm)lm=l[i];
    }

    for(i=1;i<=n&&lm;i++){
        if(l[i]==lm){printf("%d ",a[i]);lm--;}
    }

  return 0;
}

//Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.