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

//shivamkr21
#include<bits/stdc++.h>
#define endl "\n"
#define lli long long int
using namespace std;
int main()
{
    lli n;
  	cin>>n;
  	lli p,ma=-999999,sma=-999999;
    vector<lli> ar;
  	for(lli i=0;i<n;i++)
    {
      	cin>>p;
        ar.push_back(p);
      	if(p>ma)
        {
          	ma=p;
        }
      	
    }
    for(lli i=0;i<n;i++)
    {
        if(ar[i]>sma && ar[i]!=ma)
        {
            sma=ar[i];
        }
    }
    if(sma<0)
    {
        sma=ma;
    }
  	for(lli i=0;i<n;i++)
    {
      	if(ar[i]==ma)
        {
          	cout<<sma<<endl;
        }
      	else
        {
          	cout<<ma<<endl;
        }
    }
	return 0;
}