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
#!/usr/bin/env python

A=[]
B = []
max = 0
max2 = 0
count = 0
N=int(input())
for i in range(N):
    A.append(int(input()))
for i in range(len(A)):
    if A[i] > max:
        max = A[i]
        B.append(A[i])
for i in range(len(A)):
    if A[i] == max:
        count +=1

    
for i in range(len(A)):
    if count >= 2:
        print(max)
    if count == 1:
        if A[i] > max2 and A[i] != max:
            max2 = A[i]
for i in range(len(A)):
    if count ==1:
        if A[i] == max:
            print(max2)
        else:
            print(max)
