#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int,k>
template<class A, class B> void cmx(A& x, B y){ x = max<A>(x,y); }
template<class A, class B> void cmn(A& x, B y){ x = min<A>(x,y); }
typedef pair<int,int> pii;
typedef vector<int> vi;

signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
	int n; cin >> n;
	vi a(n); for(int& v : a) cin >> v;
	sort(all(a));
	vector<pii> vals;
	rep(i,0,n-1){
		vals.PB({a[i+1]-a[i],i});	
	}
	sort(all(vals));
	vi in(n-1);
	set<pii> ins; int cur = 0;
	vector<pii> chk;
	for(auto[k,i]:vals){
		int l = i, r = i;
		in[i] = 1;
		if(l > 0 && in[l-1]){
			auto itr = --lower_bound(all(ins),pii{i,-1});	
			assert(itr->SD == l-1);
			l = itr->FS;
			cur -= (itr->SD-itr->FS+2)/2;
			ins.erase(itr);
		}
		if(r+1 < n-1 && in[r+1]){
			auto itr = lower_bound(all(ins),pii{i,-1});	
			assert(itr->SD== r+1);
			r = itr->SD;
			cur -= (itr->SD-itr->FS+2)/2;
			ins.erase(itr);
		}
		ins.insert({l,r});
		cur += (r-l+1+1)/2;
		chk.PB({cur,k});
	}
	rep(i,1,n/2+1){
		auto itr = lower_bound(all(chk),pii{i,-1});
		cout << itr->second << " \n"[i==n/2];
	}
}