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 d2[100000] = {};
    int emp;
    int max,max2;
    char box[256] = {};
    char box2[256] = {};
    count = 0;
    
    // INFO //
    // n 木の本数
    // d 監視員が他に見れる本数    
    //  入力
    scanf("%d",&n);
    for (i = 0; i < n; i++){
        scanf("%d",&d[i]);
        d2[i] = d[i];
    }
    //  処理
     for (i = 0; i < n; i++){
        max = 0;
        max2 = 0;
        for (j = 0; j < n; j++){
            if (max < d[j]){
                max2 = max;
                max = d[j];
            }else if (max2 < d[j]){
                max2 = d[j];
            }
        }
        //  出力
        if (max == d[i]){
            printf("%d\n",max2);
        }else{
            printf("%d\n",max);
        }
    }   
   
    


}