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)

# 
# describe Abc134C do
#   context 'test' do
#     it 'sample' do
#       expect(Abc134C.calc(3, [1,4,3])).to match([4,3,4])
#       expect(Abc134C.calc(2, [5, 5])).to match([5,5])
#     end
#   end
# end


class Abc134C
  def self.input()
    n = STDIN.gets.to_i
    a_array = Enumerator.new do |y|
      y << STDIN.gets.to_i
    end.to_a
    [n, a_array]
  end

  def self.output(result_array)
    puts result_array
  end

  def self.calc(n, a_array)
    a_max, a_max_2 = a_array.to_enum.sort_by{|x| -1 * x }.take(2)
    result_array = a_array.map{|x| x == a_max ? a_max_2: a_max }
    result_array
  end

  def self.main()
    n, a_array = input()
    result_array = calc(n, a_array)
    output(result_array)
  end
end

if __FILE__ == $0
  Abc134C.main
  exit
end