On the evening of Halloween a group of $n$ kids collected $k$ bars of chocolate of the same type. At the end of the evening they wanted to divide the bars so that everybody gets the same amount of chocolate, and none of the bars is broken into more than two pieces. For which $n$ and $k$ is this possible?