#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    priority_queue<int, vector<int>, less<int>> data;
    for (int j = 0; j < n; j++) {
      if (i == j) continue;
      data.push(a[j]);
    }
    cout << data.top() << endl;
  }
}
