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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<stdlib.h>

int main(void){
  int N,i;
  int* A;
  scanf("%d",&N);
  A=(int*)malloc(sizeof(int)*N);
  for(i=0;i<N;i++){
    scanf("%d",&A[i]);
  }
  int first=0;
  for(i=0;i<N-1;i++){
    if(A[i+1]>A[i]){
      first=i+1;
    }
  }
  int second;
  if(first!=0){
    second=0;
  }else{
    second=1;
  }
  for(i=0;i<first-2;i++){
    if(A[i+1]>A[i]){
      second=i+1;  
    }
  }
  if(0<first<N-1){
     if(A[first+1]>A[first-1]){
      second=first+1;
    }
  }
  for(i=first+1;i<N-1;i++){
    if(A[i+1]>A[i]){
      second=i+1;
    }
  }
  for(i=0;i<N;i++){
    if(i!=first){
      printf("%d\n",A[first]);
    }else{
      printf("%d\n",A[second]);
    }
  }
  free(A);
  return 0;
}