#dwacon6thprelimsd. [dwacon6th_prelims_d]Arrangement
[dwacon6th_prelims_d]Arrangement
Problem Statement
Niwango has cards, numbered . He will now arrange these cards in a row.
Niwango wants to know if there is a way to arrange the cards while satisfying all the conditions below. To help him, determine whether such a way exists. If the answer is yes, also find the lexicographically smallest such arrangement.
- To the immediate right of Card (if any) is NOT Card .
- To the immediate right of Card (if any) is NOT Card .
- To the immediate right of Card (if any) is NOT Card .
Constraints
Input
Input is given from Standard Input in the following format:
Output
If no arrangements satisfy the conditions, print -1
. If such arrangements exist, print the lexicographically smallest such arrangement, in the following format:
Here, represents the -th card from the left.
Sample Input 1
Sample Output 1
- The arrangement is lexicographically smaller than , but is invalid, since it violates the condition "to the immediate right of Card is not Card ."
Sample Input 2
Sample Output 2
- If no arrangements satisfy the conditions, print
-1
.