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
#include<stdio.h>
int main()
{
	int n,a,x=0,x2=0,y,i;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a);
		if(x<a){
			x2=x;
			x=a;
			y=i;
		}
		else if(x2<a) x2=a;
	}
	for(i=0;i<n;i++){
		if(y==i) printf("%d\n",x2);
		else printf("%d\n",x);
	}
	return 0;
}
