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>
#include<functional>
using namespace std;
int main(){
int a,b[210000],c[210000],d ;
cin>>a;
for(int i=0;i<a;i++){
  cin>>b[i];
  c[i]=b[i];
     }
  sort(c,c+a,greater<int>());
    for(int i=0;i<a;i++){
    if(b[i]==c[0]){cout<<c[1];}
    else cout<<c[0];
      cout<<endl;
    }
}
