跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1296. z-sort

  • ID: 1302
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 排序
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

z-sort

题目描述

B. z-sort
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 787 题。保留原作者与原赛事署名。