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.nextLine());
    int max1 = 0;
    int max2 = 0;
    int[] num = new int[N];
    for(int i = 0; i < N; i++){
      num[i] = Integer.parseInt(sc.nextLine());
      if(num[i] > max1){
        max1 = num[i];
      }else if(num[i] > max2){
        max2 = num[i];
      }
    }
    
    int ans = 0;
    for(int i = 0; i < N; i++){
      if(max1 == max2){
        ans = max1;
      }else{
        if(num[i] == max1){
          ans = max2;
        }else{
          ans = max1;
        }
      }
      System.out.println(ans);
    }
  }
}