K = 2 is a special case for Josephus problem


#1

n is even so it can be calculated by 2n - 2floor(log2n) + 1 forumla.