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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;

public class ZSortCodeforces652B {
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

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

		long nextLong() {
			return Long.parseLong(next());
		}

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	};

	
	static FastReader userInput = new FastReader();
	/*private static Scanner m;

	public static void main(String[] args){
		
		int n;
		m = new Scanner(System.in);
		n=m.nextInt();
		int ara[] = new int[n];
		for(int i=0;i<n;i++)
		{
			ara[i] = m.nextInt();
		}
		Arrays.sort(ara);
		for(int number:ara)System.out.println(number);
	  }*/
	
	static int inputAra[] = new int[1007];
	static int resultAra[] = new int[1007];
	public static void main(String[] args) {

		int n = userInput.nextInt();
		 
		int i,j;
		for ( i = 1; i <= n; i++) {
			inputAra[i] = userInput.nextInt();
		}

		sortArray(n);
        
		/*for (i = 1; i <= n; i++) {
			System.out.print(inputAra[i ] + " ");
		}
		System.out.println(); */
		
		i=n;
		j=n;
		if(i%2!=0) i--;
		for(;i>1;i-=2,j--) {
			resultAra[i] = inputAra[j];
		}
		
		
		i=n;
		if(i%2==0) i--;
		for(;i>0;i-=2,j--) {
			resultAra[i] = inputAra[j];
		}

		for (i = 1; i <= n; i++) {
			System.out.print(resultAra[i ] + " ");
		}

	}// main 
	
	public static void sortArray(int n) {
		for(int i=1; i<=n; i++)
	    {
	        int min = i;
	        for(int j=i; j<=n; j++)
	        {
	            if(inputAra[j] <inputAra[min])
	                min = j;

	        }
	         int temp = inputAra[i];
	         inputAra[i] = inputAra[min];
	         inputAra[min] = temp;
	    }
	}

}
