/*
* R. Sumi Matsumoto
* Phillips Academy
* Senior-3 Contest #3
*/
import
java.util.Scanner;
public class
Mancala
{
private static int[] board = {0, 4, 4, 4,
4, 4, 4, 4, 4, 4, 4, 4, 4, 0};
public static void main(String[] args)
{
Scanner reader = new Scanner(System.in);
for (int k = 1; k <= 5; k++)
{
try
{
System.out.print("Move " + k
+ ": ");
String line = reader.nextLine();
String[] tokens =
line.split("\\s*,\\s*");
int n1 = Integer.parseInt(tokens[0]);
int n2;
if(tokens[1].equals("A"))
n2
= 0;
else
if(tokens[1].equals("B"))
n2
= 13;
else
n2
= Integer.parseInt(tokens[1]);
if(k%2 == 1)
moveA(n1,
board);
else
moveB(n1,
board);
System.out.println("Result "
+ k + ": " + getStones(n2, board));
}
catch (Exception e)
{
System.out.println("Exception in
processing: line #" + k);
}
}
}
public static void moveA(int n, int[] nums)
{
int
count = nums[n];
nums[n]
= 0;
int
i = n+1;
do
{
if(count
== 0)
{
count
= nums[i-1];
nums[i-1]
= 0;
}
for(;
count > 0; i++)
{
if(i
== 13)
i
= 0;
else
if(i == 7)
{
if(count
== 1)
{
count
= 0;
nums[0]++;
return;
}
else
{
count
-= 2;
nums[0]++;
nums[i]++;
}
}
else
{
nums[i]++;
count--;
}
}
}
while(nums[i-1] != 4 && nums[i-1] != 1);
}
public static void moveB(int n, int[] nums)
{
int
count = nums[n];
nums[n]
= 0;
int
i = n+1;
do
{
if(count
== 0)
{
count
= nums[i-1];
nums[i-1]
= 0;
}
for(;
count > 0; i++)
{
if(i
== 14)
i
= 0;
else
{
nums[i]++;
count--;
}
}
}
while(nums[i-1] != 4 && nums[i-1] != 1 && i != 14);
}
public static int getStones(int n, int[]
nums)
{
return
nums[n];
}
}