#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<vector>

#include<map>

#include<set>

#include<queue>

#include<stack>

#include<iostream>

using namespace std;

typedef long long LL;

const double pi=acos(-1.0),eps=1e-;

void File()

{

    freopen("D:\\in.txt","r",stdin);

    freopen("D:\\out.txt","w",stdout);

}

template <class T>

inline void read(T &x)

{

    char c=getchar(); x=;

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) {x=x*+c-''; c=getchar();}

}

const int maxn=;

struct X{int x,id;}s[maxn];

int n,sz,ans[maxn],a[maxn];

struct Node { int id,L,R; }node[maxn];

bool cmp(X a,X b){ return a.x<b.x;}

bool cmp1(X a,X b){ return a.id<b.id;}

int dp[maxn][];

void RMQ_init()

{

    for(int i=;i<n;i++) dp[i][]=i;

    for(int j=;(<<j)<=n;j++)

        for(int i=;i+(<<j)-<n;i++){

            if(a[dp[i][j-]]<a[dp[i+(<<(j-))][j-]]) dp[i][j]=dp[i][j-];

            else dp[i][j]=dp[i+(<<(j-))][j-];

        }

}

int RMQ(int L,int R)

{

    int k=;

    while((<<(k+))<=R-L+) k++;

    if(a[dp[L][k]]<a[dp[R-(<<k)+][k]]) return dp[L][k];

    return dp[R-(<<k)+][k];

}

void build(int L,int R,int fa,int f)

{

    int pos=RMQ(L-,R-); pos++;

    if(fa!=-)

    {

        if(f==) node[fa].L=s[pos].id;

        else node[fa].R=s[pos].id;

    }

    if(pos--L>=) build(L,pos-,s[pos].id,);

    if(R-(pos+)>=) build(pos+,R,s[pos].id,);

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++) scanf("%d",&s[i].x),s[i].id=i;

    sort(s+,s++n,cmp);

    for(int i=;i<=n;i++) a[i-]=s[i].id;

    RMQ_init(); build(,n,-,);

    sort(s+,s++n,cmp1);

    for(int i=;i<=n;i++) ans[node[i].L]=s[i].x, ans[node[i].R]=s[i].x;

    for(int i=;i<=n;i++) printf("%d ",ans[i]);

    return ;

}