#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n,x,ousx,jisx;
vector<ll> a;
vector<ll> b;
vector<ll> ous;
vector<ll> jis;

int main() {
	freopen("sort.in","r",stdin);
	freopen("sort.out","w",stdout);
	ios::sync_with_stdio(false);
    cin>>n;
    for (int i=0;i<n;i++) {
        cin>>x;
        a.push_back(x);
        b.push_back(0);
    }
    for (int i=0;i<n;i++) {
        if ((i&1)==0) ous.push_back(a[i]);
        else jis.push_back(a[i]);
    }
    sort(ous.begin(),ous.end());
    sort(jis.begin(),jis.end());
    for (int i=0;i<n;i++) {
        if ((i&1)==0) b[i]=ous[ousx++];
        else b[i]=jis[jisx++];
    }
    for (int i=0;i<n;i++) {
        cout<<b[i]<<" ";
    }
    return 0;
}