CF53C.Little Frog

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are $n$ mounds on the swamp, located on one line. The distance between the neighboring mounds is one meter. Vasya wants to visit all the mounds in one day; besides, he wants to visit each one exactly once. For that he makes a route plan, to decide the order in which to jump on the mounds. Vasya can pick any mound as the first one. He thinks it boring to jump two times at the same distance. That's why he wants any two jumps on his route to have different lengths. Help Vasya the Frog and make the plan for him.

输入格式

The single line contains a number $n$ ( $1<=n<=10^{4}$ ) which is the number of mounds.

输出格式

Print $n$ integers $p_{i}$ ( $1<=p_{i}<=n$ ) which are the frog's route plan.

All the $p_{i}$ 's should be mutually different.
All the $|p_{i}–p_{i+1}|$ 's should be mutually different ( $1<=i<=n-1$ ).

If there are several solutions, output any.

输入输出样例

输入#1
```
2
```
输出#1
```
1 2 
```
输入#2
```
3
```
输出#2
```
1 3 2 
```

首页