#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define endl "\n"
#define S second
#define F first
#define ln cout<<endl;
#define mem(a) memset((a),0,sizeof (a));
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define debug cout<<"here!"<<endl;

ll cnt,n,m,t,ans,ant;
const int N=2e5+10;
const int INF=0x3f3f3f3f;
string str;

void solve()
{
    cin>>n;
    vector<ll>a(n+1);
    for(ll i=1;i<=n;i++) cin>>a[i];
    sort(a.begin()+1,a.end());
    vector<ll>even,odd;
    ans=1e18;
    for(ll i=2;i<=n;i+=2)
    {
        even.push_back(a[i]-a[i-1]);
    }
    sort(even.begin(),even.end());

    for(ll i=3;i<=n;i+=2)
        odd.push_back(a[i]-a[i-1]);
    sort(odd.begin(),odd.end());

    while(odd.size()<even.size()) odd.push_back(1e18);
    while(odd.size()>even.size()) even.push_back(1e18);
    
    for(ll i=0;i<n/2;i++)
    {
        cout<<min(odd[i],even[i])<<' ';
    }
    
    return;
}

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