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 <iostream>
#include <algorithm>
using namespace std;
const int N = 2e5+250;
int n,i,a[N],b[N];
int main()
{
    cin>>n;
    for (i=1;i<=n;++i)
        cin>>a[i],b[i]=a[i];
    sort(a+1,a+n+1,greater<int>());
    for (i=1;i<=n;++i)
    {
        if (b[i]==a[1]) cout<<a[2]<<"\n";
        else cout<<a[1]<<"\n";
    }
}


