#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> v(n);
  int ma = 0;
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    ma = max(ma, v[i]);
  }
  for (int i = 0; i < n; i++) {
    if (ma != v[i])
      cout << ma << endl;
    else {
      auto w = v;
      w[i] = 0;
      sort(w.rbegin(), w.rend());
      cout << w[0] << endl;
    }
  }
}
