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()
{
 long n;
 cin>>n;
 vector<long> v(n);
 long max1=-1;
 long max2=-1;
 for(int i=0;i<n;i++)
 {
 	cin>>v[i];
 }
 vector<long> v2=v;
 sort(v.rbegin(),v.rend());
 for(int i=0;i<n;i++)
 {
 	if(v2[i]==v[0])
 	{
 		cout<<v[1]<<endl;
 	}
 	else
 	{
 		cout<<v[0]<<endl;
 	}
 }
 


}