z-sort

link：https://cn.vjudge.net/contest/190132#problem/I

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:

    ai ≥ ai - 1 for all even i,
    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".

Example

Input

4
1 2 2 1

Output

1 2 1 2

Input

5
1 3 2 2 5

Output

1 5 2 3 2

题解：
题目要求对于每个偶数位满足a[i]>=a[i+1]
每个奇数位满足a[i]<=a[i−1]
剩下的看代码
AC代码：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
int a[1010],b[1010],c[1010];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int n,i,t,s;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);//先从小到大排序 
    t=n & 1 ? n/2 + 1 : n/2;
    for(i=1,s=1;i<=t;i++)
    {
        b[s]=a[i];//先把 前t个数插空放入数组b 
        s+=2;
    }   
    for(s=2;i<=n;i++)
    {
        b[s]=a[i];//再把n-t个数插到刚刚留下的空中，就满足题意 
        s+=2;
    }
    for(i=1;i<=n;i++)
        printf("%d%c",b[i],i==n?'\n':' ');
return 0;   
}