import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[] leftmax=new int[N];
		int[] rightmax=new int[N];
		int[] num=new int[N];
		leftmax[0]=0;
		rightmax[N-1]=0;
		for(int i=0; i<N; i++) {
			num[i]=sc.nextInt();
		}
		for(int i=1; i<N; i++) {
			leftmax[i]=Math.max(leftmax[i-1], num[i-1]);
		}
		for(int i=N-1; i>=1; i--) {
			rightmax[i-1]=Math.max(rightmax[i], num[i]);
		}
		for(int i=0; i<N; i++) {
			System.out.println(Math.max(leftmax[i], rightmax[i]));
		}
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz