import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] A = new int[N];

		int num, maxNum = -1, nextMaxNum = -1;
		boolean duplicate = false;
		for (int i = 0; i < N; i++) {
			num = sc.nextInt();

			if (num > maxNum) {
				nextMaxNum = maxNum;
				maxNum = num;
				duplicate = false;
			} else if (num == maxNum) {
				duplicate = true;
			} else {
				nextMaxNum = Math.max(nextMaxNum, num);
			}
			A[i] = num;
		}

		for (int i = 0; i < N; i++) {
			if (A[i] == maxNum && !duplicate) {
				System.out.println(nextMaxNum);
			} else {
				System.out.println(maxNum);
			}
		}
	}

}

/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