#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));
	vi ans(n/2);
	auto rec = [&](auto&& rec, int l, int r, int ql, int qr)->void{
		if(ql > qr) return;
		if(l == r){
			rep(i,ql,qr+1) ans[i-1] = l;
			return;
		}
		int mid = (l+r)/2;
		auto f = [&](int i){
			return a[i+1]-a[i] <= mid;
		};
		int mx = 0;
		rep(i,0,n-1) if(f(i)){
			int j = i;
			while(j+1 < n-1 && f(j+1)) j++;
			int len = j-i+1;
			mx += (len+1)/2;
			i = j;
		}
		rec(rec,l,mid,ql,min(qr,mx));
		rec(rec,mid+1,r,max(mx+1,ql),qr);
	};
	rec(rec,0,1e18,1,n/2);
	rep(i,0,n/2) cout << ans[i] << " \n"[i==n/2-1];	
}