#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

struct DSU {
	vector<int> fa, sz;
	DSU(int n) : fa(n + 1), sz(n + 1) {
		for (int i = 0; i <= n; i++) {
			fa[i] = i, sz[i] = 1;
		}
	}
	int getfa(int v) {
		return (fa[v] == v) ? v : (fa[v] = getfa(fa[v]));
	}
	void merge(int u, int v) {
		u = getfa(u), v = getfa(v);
		if (u != v) {
			fa[u] = v, sz[v] += sz[u];
		}
	}
	int getsz(int v) {
		return sz[getfa(v)];
	}
};

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	struct T {
		int id, len;
		bool operator<(const T &b) const {
			return len < b.len;
		}
	};
	vector<T> t(n - 1);
	for (int i = 0; i + 1 < n; i++) {
		t[i] = {i, a[i + 1] - a[i]};
	}
	sort(t.begin(), t.end());
	vector<int> ans(n / 2 + 1);
	int cnt = 0, x = 0;
	DSU dsu(n);
	for (int i = 0; i + 1 < n; i++) {
		int v = t[i].id;
		cnt -= dsu.getsz(v) >> 1;
		cnt -= dsu.getsz(v + 1) >> 1;
		dsu.merge(v, v + 1);
		cnt += dsu.getsz(v) >> 1;
		while (x < cnt) {
			ans[++x] = t[i].len;
		}
	}
	for (int i = 1; i <= n / 2; i++) {
		cout << ans[i] << ' ';
	}
	cout << '\n';
	return 0;
}