import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer A[] = new Integer[N];
		Integer B[] = new Integer[N];
		int max = 0;
		for (int i = 0; i < N; i++) {
			A[i] = sc.nextInt();
			if (A[i] > max) {
				max = A[i];
			}
		}
		sc.close();

		for (int i = 0; i < N; i++) {
			B[i] = A[i];
		}
		Arrays.sort(B, Collections.reverseOrder());

		for (int i = 0; i < N; i++) {
			if (A[i] == max) {
				System.out.println(B[1]);
			} 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