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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
 
public class Solution
{
    public static void Main()
    {
      int N = int.Parse(Console.ReadLine());
      int[] A = new int[N];
      for (int i = 0; i < N; i++)
      {
        A[i] = int.Parse(Console.ReadLine());
      }
      // LINQでソート
      var dst = A.OrderBy(a => -a).ToList();

      int[] ans = new int[N];
      // 最大の数を持つ要素が１つの場合、２番目に大きい数を求めて、
      // 最大の数が入っているiのときだけ２番目に大きい数を出力する。
      // 最大の数が重複する場合、全て最大の数を出す。
      for (int i = 0; i < N; i++)
      {
        ans[i] = dst[0] != dst[1] ? 
          A[i] == dst[0] ? dst[1] : dst[0] : dst[0];
      }
      for (int i = 0; i < N; i++)
      {
        Console.WriteLine(ans[i]);
      }
      //Console.WriteLine($"{ans}");
    }
}