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.InputStreamReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;

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

		BufferedReader reader = new BufferedReader(
			new InputStreamReader(System.in));


		/*
		 class Pair implements Comparable<Pair>
		 {
		 int fr,se;

		 public Pair(int f, int s)
		 {
		 fr = f;
		 se = s;
		 }

		 @Override
		 public int compareTo(Pair p)
		 {
		 return this.fr - fr;
		 }

		 }

		 int n = Integer.parseInt(reader.readLine());

		 ArrayList<Pair> segment = new ArrayList<Pair>();

		 for (int i=0;i < n;++i)
		 {
		 String []arr = reader.readLine().split(" ");
		 segment.add(new Pair(Integer.parseInt(arr[0]),Integer.parseInt(arr[1])));
		 }

		 Collections.sort(segment);

		 StringBuilder res = new StringBuilder();
		 boolean flag;

		 for (int j=0;j < n;++j)
		 {
		 Pair obj = segment.get(j);
		 int f = obj.fr;
		 int s = obj.se;
		 flag = false;
		 for (int k=n - 1;k > j;--k)
		 {
		 Pair obj2 = segment.get(k);

		 int ss = obj2.se;

		 if (ss < s)
		 {
		 res.append(k - j);
		 res.append("\n");
		 flag = true;
		 break;
		 }

		 }

		 if(!flag)
		 {
		 res.append(0);
		 res.append("\n");
		 }

		 }

		 System.out.println(res.toString());
		 */


		int n = Integer.parseInt(reader.readLine());

		String []arr = reader.readLine().split(" ");
		ArrayList<Integer> vals= new ArrayList<Integer>();
		for (int i=0;i < n;++i)
			vals.add(Integer.parseInt(arr[i]));

		Collections.sort(vals);




		int []res = new int[n];
		int c = n - 1;
		for (int i=n % 2 == 0 ?n - 1: n - 2;i > -1;i -= 2)
		{
			res[i] = vals.remove(c--);
		}

		for (int i=n % 2 == 0 ?n - 2: n - 1;i > -1;i -= 2)
		{
			res[i] = vals.remove(c--);
		}

		StringBuilder ans = new StringBuilder();

		for (int j=0;j < n;++j,ans.append(" "))
			ans.append(res[j]);

		System.out.println(ans.toString());

		



	}
}




