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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Administrator
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

//codeforce
public class Maind {

	private static BufferedReader in;
	private static PrintWriter out;
	private static StringTokenizer input;

	public static void main(String[] args) throws IOException {
		// -------------------------------------------------------------------------
		// Initializing...
		new Maind();
		// -------------------------------------------------------------------------
		// put your code here... :)
		int n = nextInt();
		int[] a = new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i] = nextInt();
		}
		Arrays.sort(a);
		if (a.length <= 2) {
			for (int i = 0; i < a.length; i++) {
				System.out.println(a[i] + " ");
			}
		} else {
			int[] res = new int[n];
			int eIndex = a.length - 1;
			int oIndex = 0;
			for (int i = 0; i < a.length; i++) {
				if (i % 2 == 0) {
					res[i] = a[oIndex++];
				} else {
					res[i] = a[eIndex--];
				}
			}
			boolean valid = true;
			for (int i = 0; i < res.length; i++) {
				if (i == 0) {
					continue;
				} else if (i == res.length - 1) {
					if (res.length % 2 == 0) {
						if (res[i] <= res[i - 1] - 1)
							valid = false;
					} else {
						if (res[i] >= res[i - 1] + 1)
							valid = false;
					}
				} else {
					if(i%2==0){
						if(res[i]<=res[i-1]&&res[i]<=res[i+1]){
							continue;
						}
						valid=false;
						break;
					}else{
						if(res[i]>=res[i-1]&&res[i]>=res[i+1]){
							continue;
						}
						valid=false;
						break;
					}
				}
			}
			if(valid){
				for (int i = 0; i < res.length; i++) {
					System.out.print(res[i]+" ");
				}
			}else{
				System.out.println("Impossible");
			}
			System.out.println();
		}
		end();

		// --------------------------------------------------------------------------
	}

	private static String nextString() throws IOException {
		if (!input.hasMoreTokens())
			input = new StringTokenizer(in.readLine());
		return input.nextToken();
	}

	public Maind() throws IOException {
		// Input Output for Console to be used for trying the test samples of
		// the problem
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		// -------------------------------------------------------------------------
		// Initalize Stringtokenizer input
		input = new StringTokenizer(in.readLine());
	}

	private static int nextInt() throws IOException {
		if (!input.hasMoreTokens())
			input = new StringTokenizer(in.readLine());
		return Integer.parseInt(input.nextToken());
	}

	private static void end() throws IOException {
		in.close();
		out.close();
		System.exit(0);
	}

}
