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 {
	Scanner sc = new Scanner(System.in);
	int a,b,c,d,e,f,k,l,m,n,x,y,z;
	int ans;
	int top = -1;
	int second = -1;

	int[] An ;
	String[] S;

	Main(){
		// 整数の入力
		n = sc.nextInt();
		An = new int[n];
		for(int i=0;i<n;i++){
			An[i] = sc.nextInt();
			if(An[i]>second){
				if(An[i]>top){
					second = top;
					top = An[i];
				} else {
					second = An[i];
				}
			}
		}

		// 出力
		for(int A:An){
			System.out.println(A==top?second:top);
		}
	}

	public static void main(String[] args){
		new Main();
	}
}