#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
const int N=100005;
const ll inf=1e18;
int t,n;
ll a[N],ans[N];
void solve(int l,int r,ll L,ll R){
    if(l>r)return;
    if(L==R){
        For(i,l,r)ans[i]=L; return;
    }
    ll mid=(L+R)>>1;
    int cnt=0;
    For(i,1,n-1){
        if(a[i+1]-a[i]<=mid){
            cnt++; i++;
        }
    }
    solve(l,cnt,L,mid);
    solve(cnt+1,r,mid+1,R);
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    t=1;
    while(t--){
        cin>>n;
        For(i,1,n){
            cin>>a[i];
        }
        sort(a+1,a+n+1);
        /*int l=0,r=n-1;
        while(l<r){
            int mid=(l+r)>>1; mid++;
            if(check(mid))l=mid; else r=mid-1;
        }
        cout<<n-l<<endl;*/
        solve(1,n/2,0,inf);
        For(i,1,n/2)cout<<ans[i]<<(i<n/2?' ':'\n');
    }
}