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.*;

class Main{
	static int mod=1000000007;

	public static void main(String[] $){
		System.err.println();
		Scanner s=new Scanner(System.in);

		int n=s.nextInt();

		ArrayList<Long>a=new ArrayList<>();
		ArrayList<Long>b=new ArrayList<>();
		for(int i=0;i<n;++i) {
			int t=s.nextInt();
			a.add(t*1000000L+i);
			b.add(t*1000000L+i);
		}
		a.sort(null);

		//System.err.println(a);
		//System.err.println(b);

		for(int i=0;i<n;++i) {
			if(b.get(i)%1000000==a.get(n-1)%1000000) {
				System.out.println(a.get(n-2)/1000000);
			}else {
				System.out.println(a.get(n-1)/1000000);
			}
		}
	}
}