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
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long n = in.nextInt();
		int max=0,maxInd=0,nextMax = 0;

		for(int i = 1; i <= n; i++) {
			int tmp = in.nextInt();
			if(tmp > max) {
				nextMax = max;
				max = tmp;
				maxInd = i;
			}else if(tmp > nextMax) {
				nextMax = tmp;
			}
		}

		for(int i = 1; i <= n; i++) {
			int ans = (i != maxInd) ? max : nextMax;
			System.out.println(ans);
		}

	}
}
