gcd.pl0

var m, n, r, q;
procedure gcd;
    begin
        while r#0 do
            begin
                q := m / n;
                r := m - q * n;
                m := n;
                n := r;
            end;
    end;
begin
    while 1 = 1 do
        begin
            read(m);
            read(n);
            if m < n then
                begin
                    r := m;
                    m := n;
                    n := r;
                end;
    
            r:=1;
            call gcd;
            write(m);
        end;
end.