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 <stdio.h>
#include <vector>
int main(void){
  int n,a,max1=0,max2=0,count=0;
  std::vector<int> position_max1={};
  scanf("%d",&n);
  for(int i=0;i<n;i++){
    scanf("%d",&a);
    if(a>max1){
      max2=max1;
      max1=a;
      position_max1={i};
    }
    else if(a==max1){
      position_max1.push_back(i);
    }
    else if(max1>a && a>max2){
      max2=a;
    }
  }
  if(0==max2){
    max2=max1;
  }
  if(position_max1.size()>1){
    for(int i=0;i<n;i++){
      printf("%d\n",max1);
    }
  }
  else{
  	for(int i=0;i<n;i++){
      if(i==position_max1[count]){
        printf("%d\n",max2);
      	count++;
    	}
      else{
        printf("%d\n",max1);
      }
  	}
  }
}