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: Time Limit Exceeded)

#include <bits/stdc++.h>
using namespace std;

int main() {
 int n;cin>>n; int a[n],s[n];for(int i=0 ;i<n;i++) {
   s[i]=0;cin>>a[i] ;
 }
  
  for(int i=0;i<n;i++){
    if(i!=0 && i!=n-1){
      for(int j=0;j<i;j++) if(a[j]>s[i])s[i]=a[j];
      for(int j=i+1;j<n;j++)if(a[j]>s[i])s[i]=a[j];
    }
    
    else if(i==0){
      for(int j=1;j<n;j++)if(a[j]>s[i])s[i]=a[j];
    }
    
    else if (i==n-1){
      for(int j=0;j<n-1;j++)if(a[j]>s[i])s[i]=a[j];
    }
    cout<<s[i]<<endl;
  }
  
}