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<bits/stdc++.h>
using namespace std;

int main()
{
int n;cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++)
	{cin>>a[i];b[i]=a[i];}
int nas[n];
sort(a,a+n);
int m1=a[n-1];
int m2=a[n-2];
for(int i=0;i<n;i++)
{
	if(b[i]==m1)
		nas[i]=m2;
	else nas[i]=m1;
}
for(int i=0;i<n;i++)
	cout<<nas[i]<<endl;
return 0;
}
