A student of z-school found a kind of sorting called z-sort. The array a with n elements are z-sorted if two conditions hold:

  1. ai ≥ ai - 1 for all even i, 
  2. ai ≤ ai - 1 for all odd i > 1. 



For example the arrays [1,2,1,2] and [1,1,1,1] are z-sorted while the array [1,2,3,4] isn’t z-sorted.

Can you make the array z-sorted?

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array a.

The second line contains n integers ai (1 ≤ ai ≤ 109) — the elements of the array a.

Output

If it's possible to make the array a z-sorted print n space separated integers ai — the elements after z-sort. Otherwise print the only word "Impossible".

Examples

Input

4
1 2 2 1


Output

1 2 1 2


Input

5
1 3 2 2 5


Output

1 5 2 3 2
/**
 * Created with IntelliJ IDEA.
 * User: IAIN
 * Date: 3/27/16
 * Time: 9:35 AM
 * To change this template use File | Settings | File Templates.
 */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class zsort {
    void solve() throws IOException {
        int n = getInt();
        int [] input = new int[n];
        for(int i = 0; i < n; ++i){
            input[i] = getInt();
        }
        int [] first;
        if(n%2==0)first = new int[n / 2];
        else first = new int[n / 2 + 1];

        int [] second = new int[n / 2];
        Arrays.sort(input);
        for(int i = 0; i < ((n%2==0) ? n/2 : n/2+1); ++i){
            first[i] = input[i];
        }
        int cnt=0;
        for(int i=0;i<n/2;++i){
            second[cnt++]=input[n-i-1];
        }
        int p1=0;
        int p2=0;
        int [] res = new int[n];
        for(int i=0;i<n;++i){
           if(i%2==0)res[i]=first[p1++];
           else res[i]=second[p2++];
        }
        for(int i=0;i<n;++i){
            System.out.print(res[i] + " ");
        }
    }
    BufferedReader bufferedReader;
    PrintWriter output;
    StringTokenizer tokenizer;

    public static void main(String[] args) throws IOException {
        zsort contest = new zsort();
        contest.run();
    }

    public String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(bufferedReader.readLine());
        }
        return tokenizer.nextToken();
    }

    public int getInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public long getLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    void run() throws IOException {
        bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        output = new PrintWriter(System.out);
        solve();
    }
}
