119A Pascal

var a,b,n,i:longint;

function gcd(x,y:longint):longint;
var t:longint;
begin
    while y>0 do
    begin
        t:=x mod y;
        x:=y;
        y:=t;
    end;
    exit(x);
end;

procedure nhap;
begin
    readln(a,b,n);
end;

procedure giai;
var i:longint;
begin
    i:=0;
    while n>0 do
        begin
            inc(i);
            if i mod 2 = 1 then
                  n:=n-gcd(a,n)
            else
                   n:=n-gcd(b,n);
        end;
    if i mod 2 = 1 then
       write(0)
    else
       write(1);
end;

begin
    assign(input,'119a.inp');reset(input);
    assign(output,'119a.out');rewrite(output);
    nhap;
    giai;
end.