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,a,m=0,ms=0,im;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a;
        if(a>m){
            ms=m;
            m=a;
            im=i;
        }
        else if(a<=m && a>ms) ms=a;
    }
    for(int i=0;i<n;i++) cout<<(i!=im?m:ms)<<endl;
    return 0;
}