import java.util.*;

public class Main {
	static long gcd(long a,long b){
		return b == 0 ? a : gcd(b, a%b);
	}
	static long lcm(long a, long b){
		return a*b/gcd(a, b);
	}
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] a = new int[n];
		int[] last = new int[101010];
		for(int i=0;i<n;i++){
			a[i] = sc.nextInt();
			last[a[i]] = i;
		}
		PriorityQueue<Integer> s = new PriorityQueue<>((x,y)->y-x);
		for(int i=0;i<n;i++){
			if(!s.contains(a[i]))s.add(a[i]);
			System.out.print(s.peek());
			if(last[a[i]]==i) s.remove(a[i]);
			if(i==n-1){
				System.out.println();
			}else{
				System.out.print(" ");
			}
		}
		
	}
}