import java.util.Arrays;
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int []a = new int[n];
		int []b = new int[n];
		int high = 0;

		for(int i = 0; i < n; i++) {
			a[i] = stdIn.nextInt();
			b[i] = a[i];
			high = Math.max(high, a[i]);
		}
		Arrays.sort(b);

		for(int i = 0; i < n; i++) {
			if(a[i]!= high) {
				System.out.println(high);
			}else {
				System.out.println(b[n-2]);
			}
		}













	/*	for(int i = 0; i < max.length; i++) {
			max[i] = Integer.MIN_VALUE;
		}

		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				if(j==i) {
					continue;
				}else {
					max[i] = Math.max(max[i], a[j]);
				}
			}
		}
		for(int i = 0; i < n; i++) {
			System.out.println(max[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