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 <bits/stdc++.h>
using namespace std;
#define MAX 200000

int main() {
    int N;
    cin >> N;
    vector<int> A(MAX + 1, 0);
    for (int i = 1; i <= N; i++) {
        scanf("%d", &A[i]);
    }

    vector<int> left(MAX + 1, 0);
    vector<int> right(MAX + 1, 0);
    for (int i = 1; i <= N - 1; i++) {
        left[i] = max(left[i - 1], A[i]);
    }
    for (int i = N; i >= 2; i--) {
        right[i] = max(right[i + 1], A[i]);
    }

    for (int i = 1; i <= N; i++) {
        int ans = max(left[i - 1], right[i + 1]);
        printf("%d\n", ans);
    }

    return 0;
}