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.*;

public class Main {
  public static void main(String[] args) {
	  Scanner sc = new Scanner(System.in);
	  int N = Integer.parseInt(sc.next());
	  
	  int[] A = new int[N];
	  int max = 0;
	  int maxIndex = -1;
	  
	  int semimax = 0;
	  for(int i = 0; i < N; i++) {
		  int value = Integer.parseInt(sc.next());
		  A[i] = value;
		  
		  if(value > max) {
			  max = value;
			  maxIndex = i;
		  }
		  else if(value >= semimax) {
			  semimax = value;
		  }
	  }
	  
	  for(int i = 0; i < N; i++) {
		  if(i == maxIndex) {
			  System.out.println(semimax);
		  }
		  else {
			  System.out.println(max);
		  }
		  
	  }
	  
	  sc.close();
	  
  }
}
