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 = int(raw_input())
A = [int(raw_input()) for i in xrange(N)]

MAX = 999999999999999999999999999999999999999999999999999999999999999999999999999

dp1 = [-MAX for i in xrange(N)]
for i in range(1, N):
    dp1[i] = max(dp1[i - 1], A[i - 1])

dp2 = [-MAX for i in xrange(N)]
for i in range(N - 2, -1, -1):
    dp2[i] = max(dp2[i + 1], A[i + 1])

for i in xrange(N):
    print max(dp1[i], dp2[i])