Score : $300$ points
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:
Input is given from Standard Input in the following format:
$N$ $A_1$ $:$ $A_N$
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.
3 1 4 3
4 3 4
2 5 5
5 5