#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(),(x).end()
const int dir[][2]={1,0,-1,0,0,1,0,-1};

void solve()
{
    int n;
    cin>>n;
    vector<ll>v(n);
    for(auto&  c:v)
        cin>>c;
    sort(range(v));

    for(int k=1;k<=n/2;++k){
        ll l=0,r=1E18;
        while(l<r){
            ll mid=(l+r)>>1;
            int last=-1;
        
            int cnt=0;
            for(int i=1;i<n;++i)
                if(v[i]-v[i-1]<=mid&&last!=i-1){
                    last=i;
                    cnt++;
                }
            if(cnt>=k)
                r=mid;
            else
                l=mid+1;
        }

        

        cout<<l<<' ';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}