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 Ruby (2.3.3) (judge verdict: Wrong Answer)



def binary_insert(array, target)
  head = 0
  tail = array.count - 1
  while (head <= tail) do
    center = (head + tail) / 2
    if ( (array[center] == target) )
      return center
    elsif ( head == center)
      if(array[head] < target)
        return head
      else
        return (head+1)
      end
    elsif array[center] < target
      head = center + 1
    else
      tail = center - 1
    end
  end
end



n = gets.chomp.to_i
#puts "n = #{n}"
a = []
moto_a = []
n.times do|i|
  #puts "hello"
  if(i == 0) then
    a << gets.chomp.to_i
    moto_a << a[0]
  else
    t = gets.chomp.to_i
    moto_a << t
    #pp "now a = #{a}"
    a.insert(binary_insert(a, t) , t)
    #pp "then a = #{a}"
  end
end


n.times do|i|
  if (moto_a[i] == a[0]) 
    puts a[1]
  else 
    puts a[0]
  end
end