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,x; cin>>n; 
	vector<int>b;
	vector<int>a;
	for(int i=0;i<n;i++) {
		cin>>x; a.push_back(x); b.push_back(x);
	}
	sort(b.begin(),b.end());
	for(int i=0;i<n;i++) {
		if(a[i]==b[n-1]) cout<<b[n-2]<<endl;
		else cout<<b[n-1]<<endl;
	}
	return 0;
}