C-Constructive Problem_2021年浙大城市学院新生程序设计竞赛（同步赛）

时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Adam has an array $a$ consisting of $n$ integers $a_0, a_1, ..., a_{n-1}$ . We call this array beautiful if the number of occurrences of $i$ is $a_i$ for $i\in [0,n-1]$ .

For example:

$[1,2,1,0]$ is beautiful. In this array, $0$ appears $1$ time, $1$ appears $2$ times, $2$ appears $1$ time, and $3$ appears $0$ times, and $a_0=1,a_1=2,a_2=1,a_3=0$ .
$[0,1]$ is not beautiful. Because $a_0=0$ but in fact $0$ appears $1$ time.

Find a beautiful array of length $n$ . If there are multiple answers, output any. If there is no beautiful array of length $n$ , output $-1$ .

输入描述:

The input contains an integer   --- the length of the beautiful array.

输出描述:

Output a beautiful array of length . If there are multiple answers, output any. If there is no beautiful array of length , output .

示例1

输入

复制

输出

复制

1 2 1 0

说明

In Example 1,  or  are both beautiful array of length , and you can output any of them.

示例2

输入

复制

输出

复制

-1