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

int n;
const int N=2e5+5;
int a[N];
struct node{
	int pos,val,w;
};
inline bool operator < (node x,node y)
{
	return x.val>y.val;
}
priority_queue<node> q;
int lef[N],rig[N];
bool vis[N];

signed main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++) a[i]=a[i+1]-a[i];
	for(int i=1;i<=n-1;i++) q.push((node){i,a[i],0});
	for(int i=1;i<=n-1;i++)
	{
		if(i>1) lef[i]=i-1;
		if(i<n-1) rig[i]=i+1;
	}
	int ans=0;
	vis[0]=true;
	for(int i=1;i<=n/2;i++)
	{
		while(true)
		{
			node now=q.top(); q.pop();
			int p=now.pos, k1=lef[p], k2=rig[p];
			//if(i==2) cout<<p<<" "<<k1<<" "<<k2<<" "<<"yes"<<endl;
			if(!vis[p])
			{
				//cout<<p<<" "<<k1<<" "<<k2<<" "<<"yes"<<endl;
				vis[k1]=vis[k2]=true;
				ans=max(ans,now.val);
				rig[lef[k1]]=rig[k2];
				lef[rig[k2]]=lef[k1];
				lef[p]=lef[k1];
				rig[p]=rig[k2];
				a[p]=max(now.w,max(a[k2],a[k1]));
				q.push((node){p,a[p],now.val});
				cout<<ans<<" ";
				break;
			}
		}
	}
	cout<<"\n";
	return 0;
}