Arrange Speakers

Given an integer \(n\), arrange speakers in a sequence such that no speaker presents immediately after a speaker whose ID is consecutive. In other words, for any two adjacent speakers with IDs \(a\) and \(b\), the condition \(|a-b| \neq 1\) must hold. For example, when \(n = 5\), one valid arrangement is 1 3 5 2 4. If no valid arrangement exists, as in the case of \(n = 2\), output "Not possible".

inputFormat

The input consists of a single integer \(n\) (\(1 \leq n \leq 10^5\)) representing the number of speakers.

outputFormat

If an arrangement is possible, output the sequence of speaker IDs separated by a single space in one line. If no valid arrangement exists, output exactly "Not possible".

1

1