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.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class B {

	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	static StringTokenizer st;
	static PrintWriter out;

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

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

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

	public static float nextFloat() throws IOException {
		return Float.parseFloat(next());
	}

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

	public static void main(String[] args) throws IOException {

		long res = 0;

		int n = nextInt();

		int[] t = new int[n];

		int anPos = -1;
		boolean ok = true;
		for (int i = 0; i < n; i++) {
			t[i] = nextInt();
		}

		Arrays.sort(t);

		for (int i = 1; i < n - 1; i++) {
			int tmp = t[i];
			t[i] = t[i + 1];
			t[i + 1] = tmp;
			i++;
		}

		if (isZsorted(t)) {
			for (int i = 0; i < n; i++) {
				System.out.print(t[i] + " ");
			}
		} else {
			System.out.println("Impossible");
		}

	}

	static boolean isZsorted(int[] t) {
		for (int i = 1; i < t.length; i++) {
			if ((i + 1) % 2 == 0) {
				if (t[i - 1] > t[i])
					return false;
			} else {
				if (t[i - 1] < t[i])
					return false;
			}
		}
		return true;
	}
}
