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: Accepted)

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main(){
	int N;
	cin >>N;

	vector<int> A,B;
	for(int i = 0;i < N;i++){
		int a;
		cin >> a;
		A.push_back(a);
		B.push_back(a);
	}

	sort(A.begin(),A.end(), greater<int>());
	if(A[0] == A[1]){
		for(int i = 0;i < N;i++)
			cout << A[0]<<endl;
	}
	else{
		for(int i = 0;i < N;i++)
			if(B[i] == A[0]) cout << A[1]<<endl;
			else cout << A[0]<<endl;
	}

}