Two thieves are trying to divide a necklace evenly. The necklace is a linear
chain of beads (it is not connected in a circle). Each bead is one of k colors.
The entire necklace has n beads, and there is an even number of beads of
each color. The thieves want to split up the necklace such that each thief
gets exactly half of the beads of each color. What is the fewest number of
cuts they must make (regardless of the arrangement of the beads) to split
the necklace (in terms of n and k)?