I will rate if done in python also you may use: from collections import queue,

Here the potato always starts off with person 0. Person 0 passes the potato q times clockwise to land on person 3. This person is now out and we'll reiterate this process with person 3 starting the round but no longer being able to catch the potato. We'll skip person 3 in the future 4 Person 3 is now out. They started the round, so q passes will end up at person 1 who will now be out The full game proceeds as follows 4 In the last round, person 0 was most recently eliminated. The potato is passed from 0 to 2, to 4, and then back to 2 again In the end, 4 is the last person remaining so Jimmy should sit at that position Input The input consists of one line containing two integers n indicating the number of players and q the number of passes performed in each iterationn Note: The potato will always initially start with person 0 1 n