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 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <stdio.h>

int main(void){
int A[200000] = {};             //入力された数値を代入する配列A
int B[200000] = {};             //比較した後の数値を代入する配列B
int N, max;                     //最大値の一時保存max

scanf("%d",&N);                 //Nの入力
for(int i = 0; i < N; i++)
    scanf("%d",&A[i]);          //Aの入力

/*最大値をmaxに保存していく。ただし、i=jの時には比較を行わないようにした。 */
for(int i = 0; i < N; i++){
    max = 0;
    for(int j = 0; j < N; j++){
        if(i != j){
            if(max<A[j]){
                max=A[j];
                B[i]=max;
            }
        }
    }
}
    
for(int k = 0; k < N; k++)
    printf("%d\n", B[k]);

}