There are N robots and N position. Initially, each position consist of a single robot. You are given an array transfers, where transfer[i] denote the robot at position i teleports to position transfers[i]. A round consist of transfer of all the robots. You need to find the numbers of positions which are never empty.

Please do not give solutions just give the reference to the problem!!