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<deque>
#include<algorithm>
using namespace std;

int main() {
	size_t c; cin >> c;
	deque<int> l(c);
	for (size_t i = 0; i < c; ++i)
		cin >> l.at(i);
	auto k = l;
	sort(k.begin(), k.end());
	for (int i = 0; i < c; ++i) {
		cout << ((l.at(i) == k.at(c-1)) ? k.at(c-2) : k.at(c-1)) << endl;
	}
}