#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << #x << ':' << (x) << endl;
#define ALL(x) x.begin(),x.end()
using ll = long long;
using ld = long double;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    sort(a.begin(), a.end());
    vector<int> ans;
    if (n % 2 == 0)
    {
        for (int i = n / 2 - 1; i >= 0; --i)
        {
            ans.push_back(a[i]);
            ans.push_back(a[n - i - 1]);
        }
    }
    else
    {
        ans.push_back(a[n / 2]);
        for (int i = 1; i <= n / 2; ++i)
        {
            ans.push_back(a[n / 2 - i]);
            ans.push_back(a[n / 2 + i]);
        }
    }
    for (int i = 0; i < n; ++i) cout << ans[i] << " \n"[i == n- 1];

}