#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int count = 0;
  int mx = 0;
  for (int i = 0; i < n; i++) {
    mx = 0;
    for (int j = 0; j < n; j++) {
      if (j != count) {
        mx = max(mx, a[j]);
      }
    }
    count++;
    cout << mx << endl;
  }
  return 0;
}
