import java.util.Scanner;

class Main {
  private static void solve(int n, int[] a) {
    Integer first = null;
    Integer second = null;
    int count = 0;
    for (int val : a) {
      if (first == null || first < val) {
        second = first;
        first = val;
        count = 1;
      } else if (first == val) {
        count += 1;
      } else if (second == null || second < val) {
        second = val;
      }
    }
    int[] result = new int[n];
    for (int i = 0; i < n; i++) {
      if (a[i] != first) {
        result[i] = first;
      } else if (count > 1) {
        result[i] = first;
      } else {
        result[i] = second;
      }
    }
    for (int val : result) {
      System.out.println(val);
    }
  }
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = Integer.parseInt(sc.nextLine());
    int[] a = new int[n];
    for (int i = 0; i < n; i++) {
      a[i] = Integer.parseInt(sc.nextLine());
    }
    sc.close();
    solve(n, a);
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz