import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        solve();
    }

    private static void solve() {
        Scanner input = new Scanner(System.in);

        int n = input.nextInt();
        int[] nums = new int[n];

        int first = 0;
        int second = 0;

        for (int i = 0; i < n; i++) {
        	nums[i]  = input.nextInt();
        	if (nums[i] >= first) {
        		second = first;
        		first = nums[i];
        	} else if (nums[i] >= second) {
        		second = nums[i];
        	}
        }

        for (int i = 0; i < n; i++) {
        	if (nums[i] == first) {
                System.out.println(second);
        	} else {
                System.out.println(first);
        	}
        }
    }
}

/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