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: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;

namespace abc134
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = int.Parse(Console.ReadLine());
            List<int> A = new List<int>();
            int[] decoy = new int[N];
            for(int i = 0; i < N ; i ++){
                A.Add(int.Parse(Console.ReadLine()));
            }
            //最大値出力
            for(int j = 0; j<N;j++){
                if(j != 0 ){
                    A.CopyTo(0,decoy,0,j);
                    A.CopyTo(j+1,decoy,j+1,N-1-j);
                }else{//j == 0
                    // A.CopyTo(j,decoy,j+1,N-1);
                    A.CopyTo(1,decoy,0,N-1);
                }
                Console.WriteLine(decoy.Max());
            }
        }
    }
}