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)

require 'pp'
require 'set'

n = gets.chomp!.to_i
a_n = {}
a_n2 = SortedSet.new
n.times do |i|
    a = gets.chomp!.to_i
    a_n[a] ||= 0
    a_n[a] += 1
    a_n2 << a
end

max1 = max2 = nil
a_n2.reverse_each.with_index(0) do |x, i|
    if i == 0
        max1 = x
    elsif i == 1
        max2 = x
    else
        break
    end
end

if max2 == nil
    max2 = max1
end

#puts max1
#puts max2

a_n.each do |num, cnt|
    if max1 == num
        puts max2
    else
        puts max1
    end
end