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 (Clang 3.8.0) (judge verdict: Runtime Error)

//  AtCoder Beginner Contest 134 
//  ドタバタしてるけど頑張るぞー
#include <stdio.h>
int main(void){
    int i,j;    //ループ用変数
    int n,count;
    int d[100000] = {};
    int emp;
    int max,max2;
    count = 0;
    max = 0;
    max2 = 0;
    int xpoint = 0;
    scanf("%d",&n);
    for (i = 0; i < n; i++){
        scanf("%d",&d[i]);
        if (max < d[i]){
            count = 0;
            max2 = max;
            max = d[i];
            xpoint = i;
        }else if (max2 < d[i]){
            max2 = d[i];
        }
        if (max == d[i]){
            count++;
        }
    }
    //  処理
    if (count != 1){
        for (i = 0; i < n; i++){
            printf("%d\n",max);
        }
    }else{
        for (i = 0; i < xpoint; i++){
            printf("%d\n",max);
        }
        printf("%d\n",max2);
        for (i = xpoint + 1; i < n; i++){
            printf("%d\n",max);
        }
    }
}