Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

3
1
4
3

Sample Output 1

4
3
4

The maximum value among the two elements other than A_1, that is, A_2 = 4 and A_3 = 3, is 4.

The maximum value among the two elements other than A_2, that is, A_1 = 1 and A_3 = 3, is 3.

The maximum value among the two elements other than A_3, that is, A_1 = 1 and A_2 = 4, is 4.

Sample Input 2

2
5
5

Sample Output 2

5
5

Solution in C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
using ull = unsigned long long;
#define rep(i,n) for(ull i=0, i##_len=(n); i<i##_len; ++i)
#define repin(a,n) vector<ull> a(n);rep(i,n){cin>>a[i];}
#define in(a) ull a;cin>>a;
int main()
{
	in(n);
	repin(a, n);
	ull max1 = 0;
	rep(i, n) {
		max1 = (a[i] < max1) ? max1 : a[i];
	}
	rep(i, n) {
		if (a[i] < max1) {
			cout << max1 << "\n";
		}
		else {
			ull max2 = 0;
			rep(j, n) {
				if (i != j)
					max2 = (a[j] < max2) ? max2 : a[j];
			}
			cout << max2 << "\n";
		}
	}
}