#include<bits/stdc++.h>

 using namespace std;

 #define ll long long

 #define il inline

 #define it register int

 #define inf 0x3f3f3f3f

 #define lowbit(x) (x)&(-x)

 #define mem(a,b) memset(a,b,sizeof(a))

 #define modd 998244353

 const int maxn=5e5+;

 int n;

 ll a[maxn],b[maxn],minl[maxn],minr[maxn],suml[maxn],sumr[maxn];

 stack<int>st;

 int main(){

     scanf("%d",&n);

     for(it i=;i<=n;i++){scanf("%lld",&a[i]);}

     for(it i=;i<=n;i++){

         while(st.size()&&a[st.top()]>=a[i]){st.pop();}

         if(st.empty()){minl[i]=;}

         else{minl[i]=st.top();}

         st.push(i);

     }

     while(st.size()){st.pop();}

     for(it i=n;i>=;i--){

         while(st.size()&&a[st.top()]>=a[i]){st.pop();}

         if(st.empty()){minr[i]=n+;}

         else{minr[i]=st.top();}

         st.push(i);

     }

     for(it i=;i<=n;i++){

         if(!minl[i]){suml[i]=(ll)i*a[i];}

         else{

             suml[i]=suml[minl[i]]+(ll)(i-minl[i])*a[i];

         }

     }

     for(it i=n;i>=;i--){

         if(minr[i]==n+){sumr[i]=(ll)(minr[i]-i)*a[i];}

         else{

             sumr[i]=sumr[minr[i]]+(ll)(minr[i]-i)*a[i];

         }

     }

     ll ans=-;int pos;

     for(it i=;i<=n;i++){

         ll zz=sumr[i]+suml[i]-a[i];

         //cout<<sumr[i]<<" "<<minr[i]<<" "<<suml[i]<<endl;

         if(zz>ans){

             ans=zz,pos=i;

         }

     }

     b[pos]=a[pos];ll zhi=a[pos];

     for(it i=pos+;i<=n;i++){

         if(a[i]<zhi){

             zhi=a[i];

         }

         b[i]=zhi;

     }

     zhi=a[pos];

     for(it i=pos-;i>;i--){

         if(a[i]<zhi){

             zhi=a[i];

         }

         b[i]=zhi;

     }

     for(it i=;i<=n;i++){

         printf(i==n?"%lld\n":"%lld ",b[i]);

     }

     return ;

 }