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 = sc.nextInt();
    
    int[] A = new int[N];
    int max=1;
    int index=0;
    for(int i=0;i<N;i++){
      A[i] = sc.nextInt();
      if(A[i]>max) {
        max=A[i];
        index=i;
      }
    }
    
    int second=1;
    for(int j=0;j<N;j++){
      if(j!=index && A[j]>second){
        second=A[j]; 
      }
    }
    
    for(int k=0;k<N;k++){
      if(k!=index){
        System.out.println(max);
    } else{
        System.out.println(second);
    }
    }

  }
}