You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclusive), answer the following question:

* Find the maximum value among the N-1 elements other than A_i in the sequence.

Constraints

* 2 \leq N \leq 200000
* 1 \leq A_i \leq 200000
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1
:
A_N


Output

Print N lines. The i-th line (1 \leq i \leq N) should contain the maximum value among the N-1 elements other than A_i in the sequence.

Examples

Input

3
1
4
3


Output

4
3
4


Input

2
5
5


Output

5
5
public class Main {
	public static void main(String[] args) {
		java.util.Scanner s = new java.util.Scanner(System.in);
		int n = s.nextInt();
		int a[] = new int[n];
		int max[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = s.nextInt();
			max[i]=a[i];
		}
		java.util.Arrays.sort(max);
		int top = max[max.length-1];
		int second = max[max.length-2];
		for(int i=0;i<a.length;i++) {
			System.out.println((a[i]!=top)?top:second);
		}
	}
}
