As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定一个序列 $a_1,a_2,\dots,a_n$，你可以进行任意多次如下操作：
试求，你能得到的字典序最小的 $a$ 序列是什么？
第一行输入一个正整数 $n$。
接下来一行输入 $n$ 个整数，从小到大表示 $a_i$。
输出一行 $n$ 个整数，表示字典序最小的序列。
3 2 -3 2
-3 -1 2
$[2,-3,2] \to [2, -1, 2] \to [-3, -1, 2]$
对于 $100\%$ 的数据，保证 $1\leq n\leq 10^5$，$|a_i|\leq 10^9$。
对于测试点 $1\sim 4$，保证 $n\leq 5$。
对于测试点 $5\sim 7$，保证 $n\leq 10^3$。
对于测试点 $8\sim 10$，无特殊限制。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: