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;//list用
using System.Text;//StringBuilder用
using System.Collections;
using System.Linq;
class Program
{
    static List<int> s = new List<int>();
      static List<int> t = new List<int>();
    static decimal result;
static Hashtable ht=new Hashtable();
static int N,M;
 static int max;
  static bool maxtoo;
static long[,] table;
    static void Main()
    {
Read1();
Read2();
    for(int i=0;i<N;i++){
                    if(s[i]<max || maxtoo==true){Console.WriteLine(max.ToString());}
      else
      {
        int tmp2=0;
      for(int j=0;j<N;j++){if(s[j]>tmp2 && s[j]<max){tmp2=s[j];}}
        Console.WriteLine(tmp2.ToString());
      }
    }

    }

    static void Read1()
    {
        string tmp = Console.ReadLine();
        N = int.Parse(tmp);
    }

    static void Read2()
    {
        string tmp;
      for(int i=0;i<N;i++){
          tmp = Console.ReadLine();
        s.Add(int.Parse(tmp));
                if(s[s.Count-1]==max){maxtoo=true;}
        if(s[s.Count-1]>max){max=s[s.Count-1];maxtoo=false;}

      }
    }


    static long Gcd(long a, long b)
    {
        var v = new[] { a, b };
        while (v[1] != 0) { v = new[] { v[1], v[0] % v[1] }; }
        return v[0];
    }

    static long Lcm(long a, long b)
    {
        return a / Gcd(a, b) * b;
    }


}