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 sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] a = new int[N];
		for(int i = 0; i < N; i++) a[i] = sc.nextInt();
		int first = Integer.MIN_VALUE, second = Integer.MIN_VALUE;
		for(int i = 0; i < N; i++) {
			if(a[i] > first) {
				first = a[i];
			}else if(a[i] > second) {
				second = a[i];
			}
		}
		for(int i = 0; i < N; i++) {
			if(a[i] != first) System.out.println(first);
			else System.out.println(second);
		}
	}
}
