#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define X first
#define Y second
#define umap unordered_map
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 2e5 + 5, mod = 1e9 + 7, maxp = 31, inf = 1e9;
const ll INF = 1e18;
const double eps = 1e-6;

using i64 = long long;

struct Node{
	i64 id1, id2, diff;
	bool operator<(const Node & oth) const{
		return diff > oth.diff;
	}
};

void solve() {
	i64 n;
	cin >> n;
	vector<i64> data(n);
	vector<bool> visited(n);
	for(i64 i = 0; i < n; i++){
		cin >> data[i];
	}
	sort(data.begin(), data.end());
	priority_queue<Node> heap;
	for(int i = 1; i < n; i++){
		heap.push({i - 1, i, data[i] - data[i - 1]});
	}

	vector<i64> result(n + 1, 1e18);
	i64 curK = 0;
	i64 curValue = 0;
	while(not heap.empty()){
		curValue = max(curValue, heap.top().diff);
		i64 id1 = heap.top().id1;
		i64 id2 = heap.top().id2;
		heap.pop();
		if(visited[id1]){
			visited[id1] = false;
			visited[id1 - 1] = false;
			curK--;
		}
		if(visited[id2]){
			visited[id2] = false;
			visited[id2 + 1] = false;
			curK--;
		}

		if(not visited[id1] and not visited[id2]){
			visited[id1] = true;
			visited[id2] = true;
			curK++;
			result[curK] = min(result[curK], curValue);
		}
	}

	for(int i = 1; i <= n / 2; i++){
		cout << result[i] << ' ';
	}
	cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt = 1;
    // cin >> tt;
    while (tt--) solve();
    return 0;
}