#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000 + 10;
const int maxw = 200000 + 10;
inline int input() {
  int a = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    a = a * 10 + ch - '0';
    ch = getchar();
  }
  return a * w;
}
int s[maxn], cnt[maxw], b[maxn];
int main() {
  int n = input();
  for (int i = 0; i < n; i++) {
    s[i] = input();
    cnt[s[i]]++;
  }
  for (int i = 1; i < maxw; i++) {
    cnt[i] += cnt[i - 1];
  }
  for (int i = n - 1; i >= 0; i--) {
    b[i] = s[--cnt[s[i]]];
  }
  for (int i = 0; i < n; i++) {
    if (s[i] == b[n - 1])
      cout << b[n - 2] << endl;
    else
      cout << b[n - 1] << endl;
  }
  return 0;
}
