Prime Permutation

Given an integer $N$, find a *permutation* $P$ of length $N$, such that: - $|P_i-i|$ is [prime](https://en.wikipedia.org/wiki/Prime_number) for all $1\le i\le N$. If multiple such permutations exist, print any. If no such permutation is possible, print $-1$ instead. Note: - A permutation of length $N$ contains all integers from $1$ to $N$ exactly once. - $|X|$ denotes the absolute value of $X