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;
using System.Text;
using System.Threading.Tasks;

class Program_C
{
  static void Main(string[] args)
  {
    var N = Int32.Parse(Console.ReadLine());
    var lst = new List<int>();
    var m1 = -1;
    var m2 = -1;
    var mi = -1;
    for(var i = 0; i < N; i++)
    {
       var n = Int32.Parse(Console.ReadLine());
       if(m1 <= n)
       {
       	 m2 = m1;
         m1 = n;
         mi = i;
       }
       else if(m2 < n)
       {
         m2 = n;
       }
    }
    
    for(var i = 0; i < N; i++)
    {
    	Console.WriteLine( mi == i ? m2 : m1);
    }
  }
}