#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n;
ll a[N],b[N];
int p[N],sz[N];
bool tf[N];

vector<PII> v;
vector<ll> v2;
ll tot;

ll ans[N];


int find(int x){
    if(p[x]!=x) p[x]=find(p[x]);
    return p[x];
}

bool merge(int x,int y){
    if(!tf[x]||!tf[y]) return false;
    int fx=find(x),fy=find(y);
    tot-=(sz[fx]+1)/2;
    tot-=(sz[fy]+1)/2;
    sz[fx]+=sz[fy];
    p[fy]=fx;
    tot+=(sz[fx]+1)/2;
    return true;
}

int main(){
    cin>>n;
    for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
    sort(a+1,a+1+n);
    for(int i=1;i<n;i++) b[i]=a[i+1]-a[i];
    for(int i=1;i<=n;i++) p[i]=i,sz[i]=1;
    for(int i=1;i<n;i++){
        // cout<<b[i]<<endl;
        v.push_back({b[i],i});
        v2.push_back(b[i]);
        
    } 
    memset(ans,0x3f,sizeof ans);
    sort(v.begin(),v.end());
    sort(v2.begin(),v2.end());
    int j=0;
    for(int i=0;i<v2.size();i++){
        while(j<v.size()&&v[j].first<=v2[i]){
            // cout<<j<<endl;
            // tf[j]=1;
            bool flag=0;
            int id=v[j].second;
            tf[id]=1;
            tot++;
            if(merge(id,id+1)) flag=1;
            if(merge(id-1,id)) flag=1;
            // if(!flag) tot++;
            j++;
        }
        // cout<<tot<<endl;
        ans[tot]=min(ans[tot],v2[i]);
    }
    for(int i=1;i<=n/2;i++) printf("%lld ",ans[i]);
}