#include<bits/stdc++.h>
#define ll long long 
#define N 200099
#define irep(i,l,r) for(int i = l; i <= r; ++ i)
using namespace std;
inline ll read(){
	ll s = 0, w = 1;
	char ch = getchar();
	while(!isdigit(ch)){
		if(ch == '-')w = -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		s *= 10, s+= (ch - '0');
		ch = getchar();
	}
	return s * w;
}

int fa[N], sz[N];

int find(int x){
	if(fa[x] == x)return x;
	fa[x] = find(fa[x]);
	return fa[x];
}

void merge(int x,int y){
	//cerr << x <<' ' <<y << endl;
	x = find(x), y = find(y);
	sz[x] += sz[y];
	sz[y] = 0;
	fa[y] = x;
}
int main(){
	int n = read();
	vector<ll>a(n);
	irep(i, 0, n - 1){
		a[i] = read();
	}
	sort(a.begin(), a.end());
	vector<array<ll, 3>>d(n - 1);
	irep(i, 1, n - 1){
		d[i - 1] = {a[i] - a[i - 1], i, i - 1};
	}
	sort(d.begin(), d.end());
	vector<ll>usd(n);
	int cur = 1;
	set<array<ll, 2>>rg;
	int ok = 0;
	irep(i, 0, n - 1){
		fa[i] = i, sz[i] = 1;
	}
	for(auto [v, p, q] : d){
		ok -= sz[find(p)] / 2 - sz[find(q)] / 2;
		merge(p, q);
		ok += sz[find(p)] / 2;
		while(cur <= n / 2 && ok >= cur){
			printf("%lld ", v);
			cur ++;
		}
	}
	/*
	for(auto [v, p, q] : d){
		if(usd[p] == 0)sz ++;
		if(usd[q] == 0)sz ++;
		usd[p] = usd[q] = 1;
		while(cur <= n && sz >= cur){
			printf("%lld ", v);
			cur += 2;
		}
	}
	*/
}