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 java.util.Arrays;
import java.util.Scanner;
import java.util.stream.IntStream;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);

        int a[] = IntStream.range(0, sc.nextInt()).map(i -> sc.nextInt()).toArray();
        int temp[] = Arrays.stream(a).sorted().toArray();
        int a_max = temp[temp.length - 1];
        int a_second = temp[temp.length - 2];

        for (int i = 0; i < a.length; i++ ) {
            if (a[i] == a_max) System.out.println(a_second);
            if (a[i] != a_max) System.out.println(a_max);
        }
        sc.close();
    }
}