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: Wrong Answer)

using System;
using System.Collections.Generic;

class ExceptionHandling
{
    static void Main(string[] args)
    {
        var N = int.Parse(Console.ReadLine());
        var temp = new int[N];
        var sortedArray = new int[N];
        var secondMax = 0;
        var canSearch = true;

        for (var i = 0; i < N; i++)
        {
            temp[i] = int.Parse(Console.ReadLine());
            sortedArray[i] = temp[i];
        }

        Array.Sort(sortedArray);
        secondMax = sortedArray[N - 1];

        for (var i = 0; i < N; i++)
        {
            if (temp[i] < sortedArray[N - 1])
            {
                Console.WriteLine(sortedArray[N - 1]);
            }
            else if (temp[i] == sortedArray[N - 1])
            {
                //2番目に大きい値が必要になった時に1回だけ値を探しに行く。あとは使い回し
                if (canSearch)
                {
                    //ケツから探索して2番目に大きい値を探す
                    for (var j = N - 1; j > 0; j--)
                    {
                        if (sortedArray[N - 1] > sortedArray[j - 1])
                        {
                            secondMax = sortedArray[j - 1];
                            canSearch = false;
                            break;
                        }
                    }
                }
                Console.WriteLine(secondMax);
            }
        }
    }
}