Imagine you have 2 types of chocolates (A and B). You randomly pick up two chocolates at once from your bag in a specific pattern. If the same type of chocolates come out, you give them both to your sister. If you pick up different type of chocolates, you put 'B' type back in your bag and give the 'A' type to your sister. Initially, you have 101 chocolates of 'A' type in the bag. At the end of this chocolate distribution task, you want one chocolate of 'B' for yourself and also one in the bag. Number of 'B' chocolates can be of the form 101*n (where n>100). What is the smallest number 'n' to fulfil this condition?
I have no clue, so any hint will be appreciated