#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
ll gcd(ll n, ll m) {
  ll tmp;
  while (m != 0) {
    tmp = n % m;
    n = m;
    m = tmp;
  }
  return n;
}
ll lcm(ll n, ll m) { return abs(n * m) / gcd(n, m); }
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  map<int, int> mp;
  int maxv = 0;
  for (int i = (int)0; i < (int)n; ++i)
    cin >> a[i], mp[a[i]]++, chmax(maxv, a[i]);
  vector<int> b = a;
  sort(b.rbegin(), b.rend());
  int se = b[1];
  for (int i = (int)0; i < (int)n; ++i) {
    if (a[i] == maxv) {
      if (mp[a[i]] != 1)
        cout << maxv << endl;
      else
        cout << b[i] << endl;
    } else
      cout << maxv << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
