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>
#define faster  ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
using namespace std;

int main()
{
    faster

    int n;
    cin>>n;

    int a[n],b[n];

    int max1,max2,j;

    for(int i=0; i<n; i++)
    {
        cin>>a[i];
        b[i]=a[i];

        if(i==0)
        {
            max1=a[i];
            j=i;
        }
        else
        {
            if(a[i]>max1)
            {
                max1=a[i];
                j=i;
            }

        }
    }

    b[j]=-1;

    for(int i=0; i<n; i++)
    {

        if(i==0)
        {
            max2=b[i];
        }
        else
        {
            if(b[i]>max2)
            {
                max2=b[i];
            }

        }
    }

    for(int i=0; i<n; i++)
    {
        if(i==j)
            cout<<max2<<endl;
        else
            cout<<max1<<endl;


    }







    return 0;
}