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: Accepted)

n = gets.to_i
arr = Array.new
while line = $stdin.gets
arr.push(line.to_i)
end
if arr[0]>arr[1] then
  max1 = 0
  max2 = 1
else
  max1 = 1
  max2 = 0
end

(n-2).times{|t|
  if arr[t+2] > arr[max2] and arr[t+2] > arr[max1]then
    max2 = max1
    max1 = t+2
  elsif arr[t+2] > arr[max2] then
    max2 = t+2
  end
}
n.times{|t|
  if t == max1 then
    puts arr[max2]
  else
    puts arr[max1]
  end
}