import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = Integer.parseInt(scan.nextLine());
		int A[] = new int[N];
		int max_1 = 0, max_2 = 0;
		int kai;
		
		for(int i = 0; i < N; i++) {
			A[i] = Integer.parseInt(scan.nextLine());
			if (max_1 < A[i] && max_2 < A[i]) {
				max_2 = max_1;
				max_1 = A[i];
				
			} else if (max_2 < A[i]) {
				max_2 = A[i];
			}
		}
		
		for (int i = 0; i < N; i++ ) {
			kai = max_1;
			if (max_1 == A[i]) {
				kai = max_2;
			}
			System.out.println(kai);
		}
				 
		scan.close();
	}

}

/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