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.*;
public class Main {
	
	static int mod = (int)1e9+7;
	
	public static void main(String[] args) {		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer A[] = new Integer[N];
		for(int i=0;i<N;i++)A[i]=sc.nextInt();
		sc.close();
		
		Integer B[] = A.clone();
		Arrays.sort(A,(a1,a2)->a2-a1);
		int max = A[0];
		int max2 = A[1];
		
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<N;i++) {
			int tmax = max;
			if(B[i]==max) tmax = max2;
			sb.append(tmax + "\n");
		}
		System.out.println(sb.toString());
	}
}