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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {

		int n;

		Scanner sc = new Scanner(System.in);

		n = sc.nextInt();

		Integer[] ArrayA = new Integer[n];

		for (int i = 0; i < n; i++) {
			ArrayA[i] = sc.nextInt();
		}

		List<Integer> list = new ArrayList<Integer>(Arrays.asList(ArrayA));
		Collections.sort(list);
		int Max0 = list.get(n-1);
		int Max1 = list.get(n-2);

		for (int i = 0; i < n; i++) {

			if (ArrayA[i] == Max0) {
				System.out.println(Max1);
			} else {
				System.out.println(Max0);
			}

		}

	}
}