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 maxA = 0;
		int maxAIndex = -1;
		int max = 0;

		for (int i = 0; i < N; i++) {
			A[i] = sc.nextInt();

			if (maxA <= A[i]) {
				maxA = A[i];
				maxAIndex = i;
			}
		}

		for (int j = 0; j < N; j++) {

			max = 0;

			for (int i = 0; i < N; i++) {

				if (i == j) {
					continue;
				}

				if (!(j == maxAIndex)) {
					break;
				}

				if (max <= A[i]) {
					max = A[i];
				}
			}

			if (max == 0) {
				System.out.println(maxA);
			} else {
				System.out.println(max);
			}

		}
	}
}

/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