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(input())
A = []
max_a = 0
max_index = 0

for i in range(0, N):
    ai = int(input())
    A.append(ai)
    if max_a < ai:
        max_a = ai
        max_index = i

A.remove(max_a)

for i in range(0, N):
    if i != max_index:
        print(max_a)
    else:
        print(max(A))


