/*input
  9
  */
  /*
  FIND YOUR PURPOSE BECOME UNSTOPPABLE.
                      ,.
                    ,_> `.   ,';
                ,-`'      `'   '`'._
              ,,-) ---._   |   .---''`-),.
            ,'      `.  \  ;  /   _,'     `,
        ,--' ____       \   '  ,'    ___  `-,
        _>   /--. `-.              .-'.--\   \__
      '-,  (    `.  `.,`~ \~'-. ,' ,'    )    _\
      _<    \     \ ,'  ') )   `. /     /    <,.
    ,-'   _,  \    ,'    ( /      `.    /        `-,
    `-.,-'     `.,'       `         `.,'  `\    ,-'
    ,'       _  /   ,,,      ,,,     \     `-. `-._
    /-,     ,'  ;   ' _ \    / _ `     ; `.     `(`-\
    /-,        ;    (o)      (o)      ;          `'`,
  ,~-'  ,-'    \     '        `      /     \      <_
  /-. ,'        \                   /       \     ,-'
    '`,     ,'   `-/             \-' `.      `-. <
      /_    /      /   (_     _)   \    \          `,
        `-._;  ,' |  .::.`-.-' :..  |       `-.    _\
          _/       \  `:: ,^. :.:' / `.        \,-'
        '`.   ,-'  /`-..-'-.-`-..-'\            `-.
          >_ /     ;  (\/( ' )\/)  ;     `-.    _<
          ,-'      `.  \`-^^^-'/  ,'        \ _<
          `-,  ,'   `. `"""""' ,'   `-.   <`'
            ')        `._.,,_.'        \ ,-'
              '._        '`'`'   \       <
                >   ,'       ,   `-.   <`'
                  `,/          \      ,-`
                  `,   ,' |   /     /
                    '; /   ;        (
                    _)|   `       (
                    `')         .-'
                      <_   \   /    
                        \   /\(
                          `;/  `
  */
  #include <bits/stdc++.h>
  #define endl "\n"
  #define ll long long int
  #define vi vector<int>
  #define vll vector<ll>
  #define vvl vector < vll >
  #define pii pair<int,int>
  #define pll pair<long long, long long>
  #define mod 1000000007
  #define inf 1000000000000000001
  #define all(c) c.begin(),c.end()
  #define mem(a,val) memset(a,val,sizeof(a))
  #define eb emplace_back
  #define sz(a) int((a).size())
  #define pb push_back
  #define tr(c,i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
  #define present(c,x) ((c).find(x) != (c).end())
  #define cpresent(c,x) (find(all(c),x) != (c).end())     
  #define rep(i,j,n) for(ll i=j;i<n;i++)
  #define mp make_pair
  #define hell 998244353
  //s.replace(s.find("10"), sizeof("10") - 1, "");
  using namespace std;
  ll gcd(ll a,ll b){
    if(b==0) return a;
    return gcd(b,a%b);
  }
  bool compare(const pair<int, int>&i, const pair<int, int>&j)
    {
      return i.second < j.second;
    }
  bool isPrime(ll j)
{
	if(j==2)
	return true;
	if(j%2==0)
	return false;
	for(ll i=3;i*i<=j;i=i+2)
	if(j%i==0)
	return false;
	return true;
}
  bool isSubSequence(string str1, string str2, int m, int n) 
  { 
    int j = 0; // For index of str1 (or subsequence 

    // Traverse str2 and str1, and compare current character  
    // of str2 with first unmatched char of str1, if matched  
    // then move ahead in str1 
    for (int i=0; i<n&&j<m; i++) 
      if (str1[j] == str2[i]) 
        j++; 

    // If all characters of str1 were found in str2 
    return (j==m); 
  } 
  ll modularExponentiation(ll x,ll n)
  {
      if(n==0)
          return 1;
      else if(n%2 == 0)        //n is even
          return modularExponentiation((x*x),n/2);
      else                             //n is odd
          return (x*modularExponentiation((x*x),(n-1)/2));

  }
  int issq(ll n)
  {
    ll a=sqrt(n);
    return (a*a==n?1:0);
  }
  int main()
  {
    // added the two lines below 
    ios_base::sync_with_stdio (false); 
    cin.tie(NULL);
    ll n;
    cin>>n;
    ll arr[n],cp[n];
    for(int i=0;i<n;i++){
      cin>>arr[i];
      cp[i]=arr[i];
    }
    sort(cp,cp+n);
    for(int i=0;i<n;i++){
      if(arr[i]!=cp[n-1]){
        cout<<cp[n-1]<<endl;
      }
      else {
        cout<<cp[n-2]<<endl;
      }
    }
    

  

  }
        

Measured memory_bytes: 4736