package main

func reinitializePermutation(n int) int {
	ans := 0
	originPerm := make([]int, n)
	perm := make([]int, n)
	tmp := make([]int, n)
	for i := 0; i < n; i++ {
		originPerm[i] = i
		perm[i] = i
		tmp[i] = i
	}

	for {
		for i := 0; i < n; i++ {
			if i%2 == 0 {
				tmp[i] = perm[i/2]
			} else {
				tmp[i] = perm[n/2+(i-1)/2]
			}
		}
		copy(perm, tmp)
		ans++

		if equal(perm, originPerm) {
			return ans
		}
	}
}

func equal(a, b []int) bool {
	if len(a) != len(b) { // 对于本题，a b 的长度是相同的
		return false
	}

	for i, v := range a {
		if v != b[i] {
			return false
		}
	}
	return true
}