#include<iostream>
#include<algorithm>
#include<vector>
#define int long long
using namespace std;
int r[1000010],ans[1000010],dif[1000010],n; // dif[i]:r[i] - r[i - 1]
int check(int mid) { //How many pairs we can get with the largest rating difference between 
					 //the chess players in a pair is mid?
	int ans = 0;
	for(int i = 2;i <= n;i++) {
		if(dif[i] > mid) { // can't choose this
			continue;
		} else {
			ans++;
			i++; //skip the next one
		}
	}
	return ans;
}
void Solve(int l,int r1,vector<int> k) {
	if(k.empty()) return;
	//cout << l << " " << r1 << "\n";
	if(l > r1) return;
	int mid = (l + r1) / 2;
	int x = check(mid);
	vector<int> left,right;
	for(auto o:k) {
		if(x >= o) { // mid is an acceptable number
			ans[o] = mid;
			left.push_back(o); // make mid smaller
		} else {
			right.push_back(o); // make mid bigger
		}
	}
	Solve(l,mid - 1,left);
	Solve(mid + 1,r1,right);
}
signed main()
{
	//freopen("data.in","r",stdin);
	//freopen("data.out","w",stdout);
	cin.tie(0) -> ios::sync_with_stdio(false);
	cin >> n;
	for(int i = 1;i <= n;i++) {
		cin >> r[i];
	}
	sort(r + 1,r + n + 1); // We can prove that if r is sorted , then only the (i,i + 1) pair 
						   // will be chosen 
	for(int i = 1;i <= n;i++) {
		dif[i] = r[i] - r[i - 1];
	}
	vector<int> v;
	for(int i = 1;i <= n / 2;i++) {
		v.push_back(i);
	}
	Solve(1,1e18,v);
	for(int i = 1;i <= n / 2;i++) {
		cout << ans[i] << " ";
	}
	cout << "\n";
}