重新排列给定的整数数组，使得任意两个相邻元素的和都不能被 $3$ 整除。
第一行包含一个整数 $N$ ($1 \le N \le 10000$)，表示数组中元素的个数。
第二行包含数组中的元素，由单个空格分隔。这些元素都是小于 $1000000$ 的正整数。
如果存在任何合法的重新排列，在单行中输出它。否则，输出 "impossible"。
3 1 2 3
2 3 1
5 4 6 3 9 8
3 4 6 8 9
6 3 7 6 4 2 8
3 7 4 6 2 8
3 3 12 9
impossible
The discussion section is only for posting: 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: