#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=4e5+5;
int n;
LL a[N],ans[N];
pair<LL,int>b[N];
int fa[N],sz[N];
inline int find(int x){while(x!=fa[x])x=fa[x]=fa[fa[x]];return x;}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	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)b[i]=make_pair(a[i+1]-a[i],i);
	sort(b+1,b+n+1);
	for(int i=1;i<=n;++i)fa[i]=i,sz[i]=1;
	int nw=0,pre=0;
	memset(ans,0x3f,sizeof ans);
	for(int i=1;i<n;++i){
		int x=b[i].second,y=b[i].second+1;
		x=find(x),y=find(y);
		nw-=sz[x]/2+sz[y]/2;
		sz[x]+=sz[y],fa[y]=x;
		nw+=sz[x]/2;
		while(pre<nw){
			++pre;
			ans[pre]=b[i].first;
		}
		if(pre>=n/2)break;
	}
	for(int i=1;i<=n/2;++i)
		cout<<ans[i]<<" \n"[i==n/2];
	return 0;
}