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.Linq;
class Program
{
    static void Main(string[] args)
    {
        int ct = int.Parse(Console.ReadLine());
        int[] v = new int[ct];
        for (var i = 0; i < ct; i++)
        {
            v[i] = int.Parse(Console.ReadLine());
        }

        int x = 1;
        for (var i = 0; i < ct; i++)
        {
            x = Math.Max(v[i], x);
        }
        int ct_x = 0;
        for (var i = 0; i < ct; i++)
        {
            if (x == v[i]) ct_x++;
        }

        for (var i = 0; i < ct; i++)
        {
            int ans = 0;
            if (ct_x > 1 || v[i] != x)
            {
                ans = x;
            }
            else
            {
                int x2 = 1;
                for (var j = 0; j < ct; j++)
                {
                    if (i != j) x2 = Math.Max(v[j], x2);
                }
                ans = x2;
            }
            Console.WriteLine(ans);
        }
    }
}