Question #1
___________

class Person
{
	private Person left;
	private Person right;


	private int numberInCircle ()
	{
		Person p = this;
		int counter = 1;
		while (p.right != this) 
		{
			p = p.right;
			counter++;
		}
		return counter;		
	}
	

	public Person nThNeighborToRight (int n)
	{
		int d = numberInCircle ();
		int k;

		///////////////////////////////////////////////
		
		k = n % d;
		
		///////////////////////////////////////////////

		
		//Find the kth neighbor to the right of this person, and return it.

		for (int i=1; i <= k; i++)
			p = p.right;
		return p;
		///////////////////////////////////////////////////////////////////

	}	


}