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.StringTokenizer;

public class A {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		StringTokenizer tk = new StringTokenizer(br.readLine());
		
		int r []= new int[n];
		
		for (int i = 0; i <n; i++) {
			r[i]= Integer.parseInt(tk.nextToken());
		}
		
		Arrays.sort(r);
		int y[] = new int [n];
		int j=0;
		for (int i = 0; j < y.length /2 +1; i++,j++) {
			y[i] = r[j];
			if(i<y.length-2)
			y[++i]=r[r.length-j-1];
			}
		
		boolean flag = true;
		
		for (int i = 1; i < y.length; i++) {
			if(i%2==1)
				if(!(y[i-1] <= y[i])){
					flag= false;
					System.out.println("Impossible");
					break;
				}
				if(i%2==0)
					if(!(y[i-1] >= y[i])){
						flag = false;
						System.out.println("Impossible");
						break;
					}
				
				
					
						
		}
		
			if(flag)
				for (int i = 0; i < y.length; i++) {
					if(i!=y.length-1)
					System.out.print(y[i]+" ");
					else
						System.out.print(y[i]);
				}
	}

}
