K = 2 is a special case for Josephus problem

[kaushal_sahu]

n is even so it can be calculated by 2n - 2^{floor(log₂n)} + 1 forumla.