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.*;
import java.io.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] array = new int[n];
		for(int i = 0; i < n; i++)
			array[i] = sc.nextInt();
		
		int m1 = 0, i1 = 0, m2 = 0, i2 = 0;
		for(int i = 0; i < n; i++) {
			if(array[i] >= m1) {
				m2 = m1;
				i2 = i1;
				m1 = array[i];
				i1 = i;
			} else if(array[i] > m2) {
				m2 = array[i];
				i2 = i;
			}
		}
		
		for(int i = 0; i < n; i++) {
			if(i == i1)
				System.out.println(m2);
			else
				System.out.println(m1);
		}
	}
}
