#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int maxn=200000;
ll n;
ll a[maxn+50];

ll vis[maxn+50];
ll fa[maxn+50];
ll sz[maxn+50];

ll ans[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++) cin >> a[i];
	
	ll lim=n/2;
	sort(a+1,a+n+1);
	for (int i=1;i<n;i++) a[i]=a[i+1]-a[i];
	n--;
	
	map<ll,ll> dict;
	for (int i=1;i<=n;i++) dict[a[i]]=i;
	
	function<int(int)> getfa = [&](int x){
		return fa[x]==x?x:fa[x]=getfa(fa[x]);	
	};
	
	ll sum=0;
	auto conn = [&](int x,int y){
		int fax=getfa(x);
		int fay=getfa(y);
		if (fax!=fay){
			ll sum1=sz[fax];
			ll sum2=sz[fay];
			fa[fay]=fax;
			sz[fax]=sum1+sum2;
			sum-=(sum1+1)/2;
			sum-=(sum2+1)/2;
			sum+=(sum1+sum2+1)/2;
		}
	};
	
	ll presum=0;
	for (auto [x,pos]:dict){
		vis[pos]=1;
		sz[pos]=1;
		fa[pos]=pos;
		sum++;
		if (vis[pos-1]) conn(pos-1,pos);
		if (vis[pos+1]) conn(pos,pos+1);
		for (int i=presum+1;i<=sum;i++) ans[i]=x; 
		presum=sum;
	}
	for (int i=1;i<=lim;i++) cout << ans[i] << " \n"[i==lim];
	return 0;	
}