#include <cstdio>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;

const int N = 1e6 + 500;

ll treba[N];
int n, par[N], siz[N], mogu;

vector < ll > v;

int pr(int x) {
	if(par[x] == x) return x;
	return par[x] = pr(par[x]);
}

void mrg(int x, int y) {
	x = pr(x); y = pr(y);
	if(x == y) return;
	mogu -= siz[x] / 2;
	mogu -= siz[y] / 2;
	siz[x] += siz[y];
	mogu += siz[x] / 2;
	par[y] = x;	
}

vector < pair < ll, int > > vp;

int main(){
	scanf("%d", &n);
	for(int i = 0;i < n;i++) {
		ll x; scanf("%lld", &x);
		v.PB(x); par[i] = i; siz[i] = 1;
		treba[i] = (ll)1e18 + 500;
	}
	sort(v.begin(), v.end());
	for(int i = 0;i + 1 < n;i++)
		vp.PB({v[i + 1] - v[i], i + 1});
	sort(vp.begin(), vp.end());
	for(auto tmp : vp) {
		mrg(tmp.Y, tmp.Y + 1);
		treba[mogu] = min(treba[mogu], tmp.X);
	}
	for(int i = n / 2;i >= 1;i--) treba[i] = min(treba[i], treba[i + 1]);
	for(int i = 1;i <= n / 2;i++) printf("%lld ", treba[i]);
	printf("\n");
	return 0;
}