Split Permutation

The *goodness* of a permutation is the **maximum** integer $k$ such that the permutation can be split${^\ddag}$ into **exactly** $k$ subarrays where each subarray has the **same sum**. You are given an integer $N$. Generate a permutation of length $N$ which has **maximum** *goodness*. If multiple permutations with maximum goodness exist, print any. ${^\dag}$A permutation of length $N$ consists