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
import java.io.*;
import java.sql.SQLOutput;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;



public class testing {
    static long swaps=0;
    static int[] p;

    public static int[] inversion(int b,int e)
    {   if (b==e)
        {
            return new int[]{p[b]};
        }
        int m=b+e>>1;
        int[] Left= inversion(b,m);
        int[] Right= inversion(m+1,e);
        int[] Result= new int[e-b+1];
        int i=0;
        int j=0;
        int ind=0;
        while (i<Left.length && j<Right.length)
        {
            if (Left[i]<=Right[j])
                Result[ind++]=Left[i++];
            else
            {
                Result[ind++]=Right[j++];
                swaps+=Left.length-i;
            }
        }
        while (i<Left.length)
            Result[ind++]=Left[i++];
        while (j<Right.length)
            Result[ind++]=Right[j++];
        return Result;
    }




    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n= sc.nextInt();

        int[] num= new int[n];
        for (int i=0;i<n;i++)
            num[i]=sc.nextInt();
        Arrays.sort(num);
        int[] test = new int[n];

        boolean even = true;
        int j=0;
        int k= n-1;
        for (int i=0;i<n;i++)
        {
            if (even)
            {
                test[i]=num[j++];
            }
            else
            {
                test[i]=num[k--];
            }
            even = !even;
        }

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < n; i++)
            sb.append(test[i] + " ");

        out.println(sb.toString().trim());
        out.flush();


    }
    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }

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

        public String nextLine() throws IOException {
            return br.readLine();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

        public Long nextLong() throws IOException {
            return Long.parseLong(next());
        }

        public boolean ready() throws IOException {
            return br.ready();
        }

        public void waitForInput() throws InterruptedException {
            Thread.sleep(4000);
        }
    }
}