#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 600050
using namespace std;
inline char nc() {static char *p1,*p2,buf[100000]; return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;}
int rd() {int x=0; char c=nc(); while(!isdigit(c)) c=nc(); while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=nc(); return x;}
struct Node {int num,id,v;
}a[N];
bool cmp_num(const Node &x,const Node &y) {return x.num<y.num;}
bool cmp_id(const Node &x,const Node &y) {return x.id<y.id;}
int n,wa[N],wb[N],Ws[N],wv[N],r[N],sa[N],rank[N],height[N],m,turn[N];
void build_sa()
{m=n;int i,j,p,*x=wa,*y=wb,*t;for(i=0;i<m;i++) Ws[i]=0;for(i=0;i<n;i++) Ws[x[i]=r[i]]++;for(i=1;i<m;i++) Ws[i]+=Ws[i-1];for(i=n-1;~i;i--) sa[--Ws[x[i]]]=i;for(j=p=1;p<n;j<<=1,m=p){for(p=0,i=n-j;i<n;i++) y[p++]=i;for(i=0;i<n;i++) if(sa[i]-j>=0) y[p++]=sa[i]-j;for(i=0;i<n;i++) wv[i]=x[y[i]];for(i=0;i<m;i++) Ws[i]=0;for(i=0;i<n;i++) Ws[wv[i]]++;for(i=1;i<m;i++) Ws[i]+=Ws[i-1];for(i=n-1;~i;i--) sa[--Ws[wv[i]]]=y[i];for(t=x,x=y,y=t,x[sa[0]]=0,p=i=1;i<n;i++){if(y[sa[i-1]]==y[sa[i]]&&y[sa[i-1]+j]==y[sa[i]+j]) x[sa[i]]=p-1;else x[sa[i]]=p++;}}
}
int main()
{int i;n=rd(); for(i=1;i<=n;i++) a[i].num=rd(),a[i].id=i;sort(a+1,a+n+1,cmp_num);int j=0; a[0].num=a[1].num-1;for(i=1;i<=n;i++){if(a[i].num!=a[i-1].num) j++;a[i].v=j; turn[j]=a[i].num;}sort(a+1,a+n+1,cmp_id);for(i=0;i<n;i++) r[i]=r[i+n]=a[i+1].v;n<<=1; r[n++]=0;build_sa();i=0; while(sa[i]>n/2) i++;for(j=sa[i];j<sa[i]+n/2;j++) printf("%d ",turn[r[j]]); puts("");return 0;
}