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;
const int maxn=2e5+7;
int f[maxn],s[maxn],x[maxn];
int main()
{
	int n;cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x[i]);
		f[i]=max(f[i-1],x[i]);
	}
	for(int i=n;i>=1;i--)
	{
		s[i]=max(s[i+1],x[i]);
	}
	for(int i=1;i<=n;i++)
	{
		cout<<max(f[i-1],s[i+1])<<endl;
	}
}