

def binary_insert(array, target)
  head = 0
  tail = array.length - 1
  while (head <= tail) do
    center = (head + tail) / 2
    if ( (array[center] == target) )
      return center
    #els
    elsif ( head == tail)
      if(array[head] >= target)
        return head
      else
        return (head+1)
      end
    
    elsif (head + 1 == tail)
      if(target <= array[head])
        return head
      elsif(array[head] <= target && target <= array[tail])
        return head+1
      else
        return tail+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 = []
a << gets.chomp.to_i
moto_a << a[0]
if(n > 1) then
  (n-1).times do|i|
    t = gets.chomp.to_i
    moto_a << t
    j = binary_insert(a,t)
    #puts "now a = #{a}"
    #puts "now j = #{j}"
    a.insert(j , t)
    #puts "after a = #{a}"
    #puts "================-"
    
  end
end

#pp a
#pp moto_a
#puts "aisdflkj"
l = a.length

n.times do|i|
  if (moto_a[i] >= a[l-1]) 
    puts a[l-2]
  else 
    puts a[l-1]
  end
end