Array Graph

For an array $A$ of size $N$, we create a graph $G$ consisting of $N$ vertices by adding the bidirectional edge $(i, A_i)$ for each $1 \le i \le N$. We say an array is good if the corresponding graph is connected. Find a rearrangement of the given array $A$ such that the rearranged array is good, or output $-1$ if no such array exists. ### Input - The first line of input will contain a single