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: Accepted)

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

static int compareInt(const void* a, const void* b);
static int compareInt(const void* a, const void* b)
{
    int aNum = *(int*)a;
    int bNum = *(int*)b;

    return bNum - aNum;
}
int main(){
  int N;
  /*個数の入力*/
  scanf("%d",&N);
  int a[N];
  for(int i=0;i<N;i++){
    scanf("%d",&a[i]);
  }
  int b[N];
  for(int i=0;i<N;i++){
    b[i]=a[i];
  }
  qsort(b, N, sizeof(int), compareInt);
  for(int i=0;i<N;i++){
    if(a[i]==b[0]){
      printf("%d\n",b[1]);
    }else{
      printf("%d\n",b[0]);
    }
  }
  return 0;
}