import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

public class Main {

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
	
	class SegTree{
		int n=1;
		int[] v;
		int nil=-1;
		
		public SegTree(int n_) {
			while(n<n_)n*=2;
			v=new int[2*n-1];
			Arrays.fill(v, nil);
		}
		
		void push(int k) {
			if(2*k+2<v.length&&v[k]!=nil) {
				v[2*k+1]=v[k];
				v[2*k+2]=v[k];
			}
		}
		
		int query(int a,int b,int val) {
			return query(0,n,a,b,0,val);
		}
		
		int query(int a,int b) {
			return query(0,n,a,b,0,nil);
		}
		
		int query(int l,int r,int a,int b,int k,int val) {
			push(k);
			if(r<=a||b<=l)return nil;
			else if(a<=l&&r<=b&&(val!=nil||r-l==1)) {
				if(val!=nil) {
					v[k]=val;
					push(k);
				}
				return v[k];
			}else {
				int vl=query(l,(l+r)/2,a,b,2*k+1,val);
				int vr=query((l+r)/2,r,a,b,2*k+2,val);
				v[k]=nil;
				return Math.max(vl, vr);
			}
		}
	}
	
	void run() {
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		long[] a=new long[n];
		for(int i=0;i<n;++i) {
			a[i]=sc.nextLong()<<32|i;
		}
		Arrays.sort(a);
		SegTree seg=new SegTree(n);
		for(int i=0;i<n;) {
			int j=i;
			int left=n,right=-1;
			while(j<n&&a[i]>>32==a[j]>>32) {
				left=Math.min(left, (int)a[j]);
				right=Math.max(right, (int)a[j]);
				++j;
			}
			seg.query(left, right+1,(int)(a[i]>>32));
			i=j;
		}
		for(int i=0;i<n;++i) {
			System.out.print(seg.query(i, i+1)+(i==n-1?"\n":" "));
		}
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		long t = System.currentTimeMillis();
		new Main().run();
		System.err.println(System.currentTimeMillis() - t);
	}
}
	
	
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    
    public int nextInt() {
    	return (int)nextLong();
    }
}