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.

Examples

Input

3
1
4
3


Output

4
3
4


Input

2
5
5


Output

5
5
N = raw_input()
counter = 0
num_array = []
max_data = 0
second_max = 0
while counter < int(N):
  num_array.append(int(raw_input()))
  if(num_array[counter] > max_data):
    max_data = num_array[counter]
  elif(num_array[counter] > second_max):
    second_max = num_array[counter]
  counter += 1
counter = 0  
while counter < int(N):
  if(num_array[counter] != max_data):
    print max_data
  else:
    print second_max
  counter += 1 
 