
n = gets.chomp.to_i
#puts "n = #{n}"
a = []
moto_a = []

a << gets.chomp.to_i
a << gets.chomp.to_i
max = 1
second_max = 0
max_index = 0
second_max_index = 0
max_count = 0

if(a[0] > a[1])
  max = a[0]
  second_max = a[1]
  max_index = 0
  second_max_index = 1
  moto_a << 1
  moto_a << -1
  max_count = 1
elsif a[0] == a[1]
  max = a[0]
  second_max = a[1]
  max_index = 0
  second_max_index = 1
  moto_a << 1
  moto_a << 1
else
  max = a[1]
  second_max = a[0]
  max_index = 1
  second_max_index = [0]
  moto_a << -1
  moto_a << 1
  max_count = 1
end
ind = 1

#puts "max = #{max}, second_max = #{second_max}"

(n-2).times do|ii|
  i = ii + 2
  t = gets.chomp.to_i
  if(max < t)
    moto_a[second_max_index] = ind
    second_max = max
    second_max_index = max_index
    max_index = i
    max = t
    ind  += 1
    moto_a << ind
  elsif (max == t)
    moto_a << ind
    
  elsif (second_max < t)
    second_max = t
    second_max_index = i 
    moto_a << ind-1
  else 
    moto_a << ind-1
  end
  #puts "now moto_a = #{moto_a}"

end
n.times do|i|
  if(moto_a[i] < ind)
    puts max
  else
    puts second_max
  end 
end
#pp moto_a
