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

public class Main {

	public static void main(String[] args) {

		Scanner scan = new Scanner(System.in);

		int N = scan.nextInt();

		List<Integer> list = new ArrayList<>();
		List<Integer> subList = new ArrayList<>();

		for(int i = 0; i < N; i++) {
			list.add(scan.nextInt());
			subList.add(list.get(i));
		}

		Collections.sort(subList);

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

			// A1がAmaxと等しい
			if(subList.get(N -1) == list.get(i)) {
				// 2番目に大きい値
				System.out.println(subList.get(N -2));
			}else {
				System.out.println(subList.get(N - 1));
			}

		}
	}
}