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
import math
import sys
minint = -sys.maxint - 1
maxint = sys.maxint

n = int(raw_input())
a = []
m = [0]*2
mx, mx2, ind, ind2 = minint, minint, 0, 0
for i in range(n):
  v = int(raw_input())
  if v > mx:
    mx, ind = v, i
  elif v > mx2:
    mx2, ind2 = v, i
  a += [v]
for i in range(n):
  if i == ind:
    print(mx2)
  else:
    print(mx)