B'Simon and Antisimon play a game. Initially each player receives one fixed positive integer that doesn 't change throughout the game. Simon receives number a and Antisimon receives number b. They also have a heap of n stones. The players take turns to make a move and Simon starts. During a move a player should take from the heap the number of stones equal to the greatest common divisor of the fixed number he has received and the number of stones left in the heap. A player loses when he cannot take the required number of stones (i. e. the heap has strictly less stones left than one needs to take). Your task is to determine by the given a, b and n who wins the game. The only string contains space-separated integers a, b and n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a, xe2 x80 x89b, xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100) -- the fixed numbers Simon and Antisimon have received correspondingly and the initial number of stones in the pile. If Simon wins, print "0" (without the quotes), otherwise print "1" (without the quotes). The greatest common divisor of two non-negative integers a and b is such maximum positive integer k, that a is divisible by k without remainder and similarly, b is divisible by k without remainder. Let gcd(a, xe2 x80 x89b) represent the operation of calculating the greatest common divisor of numbers a and b. Specifically, gcd(x, xe2 x80 x890) xe2 x80 x89= xe2 x80 x89gcd(0, xe2 x80 x89x) xe2 x80 x89= xe2 x80 x89x. In the first sample the game will go like that: In the second sample each player during each move takes one stone from the heap. As n is even, Antisimon takes the last stone and Simon can 't make a move after that.'...