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: Wrong Answer)

#include<iostream>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;

void swap(int *u, int *v){
    int temp = *u;
    *u = *v;
    *v = *u;
}

int main(void){
    int n;
    cin >> n;
    int a[n];
    rep(i, n){
        cin >> a[i]; 
    }
    int m[2] = {0};
    rep(i, n){
        if(a[i] > m[1]){
            m[1] = a[i];
        }
        if(m[0] < m[1]){
            swap(&m[0], &m[1]);
        }
    }

    rep(i, n){
        if(a[i] != m[0]){
            cout << m[0] << endl;
        }else{
            cout << m[1] << endl;
        }
    }
    return 0;
}