
import java.util.Arrays;
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 maxv = 0;
		int maxi = 0;
		for(int i = 0; i< N; i++) {
			A[i] = sc.nextInt();
			if(maxv < A[i]) {
				maxv = A[i];
				maxi = i;
			}
		}
		Arrays.sort(A);
		if(A[N -2] == A[N - 1]){
			for(int i = 0; i < N; i++) {
				System.out.println(A[N - 1]);
			}
		}else {
			for(int i = 0; i < N; i++) {
				if(i == maxi) {
					System.out.println(A[N - 2]);
				}else {
					System.out.println(A[N - 1]);
				}
			}
		}

	}

}

/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