#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)

int main() {
    ll n;
    cin >> n;
    vector<ll> A(n), sA;
    rep(i, n) cin >> A[i];
    sA = A;
    sort(sA.rbegin(), sA.rend());
    rep(i, n) {
        if (A[i] == sA[0]) cout << sA[1] << endl;
        else cout << sA[0] << endl;
    }
    return 0;
}