#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
template <typename it>
void db(it *begin, it *end) {
  while (begin != end) cout << (*begin++) << " ";
  puts("");
}
template <typename it>
string to_str(it n) {
  string s = "";
  while (n) s += n % 10 + '0', n /= 10;
  reverse(s.begin(), s.end());
  return s;
}
template <typename it>
int o(it a) {
  cout << a << endl;
  return 0;
}
long long mul(long long a, long long b, long long c) {
  long long ans = 0;
  for (; b; b >>= 1, a = (a + a) % c)
    if (b & 1) ans = (ans + a) % c;
  return ans;
}
long long ksm(long long a, long long b, long long c) {
  long long ans = 1;
  for (; b; b >>= 1, a = mul(a, a, c))
    if (b & 1) ans = mul(ans, a, c);
  return ans;
}
int n;
int a[N];
int pre[N] = {0}, suf[N] = {0};
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    pre[i] = max(pre[i], a[i]);
  }
  for (int i = n; i >= 1; i--) suf[i] = max(suf[i + 1], a[i]);
  for (int i = 1; i <= n; i++) {
    o(max(pre[i - 1], suf[i + 1]));
  }
}
