I have a question about the CSES Permutations problem.

https://cses.fi/problemset/task/1070/

A permutation of integers 1,2,…,n is called *beautiful* if there are no adjacent elements whose difference is 1.

Given n, construct a beautiful permutation if such a permutation exists.

I have tried to write some permutations down and find a pattern, but I had no idea, Someone please give me a clue of how to solve this problem.