var GET = (function () {function f(s) {return new g(s);}function g(s) {this._s = s.trim().split("\n");}g.prototype.getValue = function (n) {return this._s[n];};g.prototype.getArray = function (n) {return this.stoa(this._s[n]);};g.prototype.slice = function (s, limit) {return this._s.slice(s, +limit + s || undefined).map(v => this.stox(v));};g.prototype.sliceArray = function (s, limit) {return this._s.slice(s, +limit + s || undefined).map(v => this.stoa(v));};g.prototype.stoa = function (s) {return s.split(" ").map(v => this.stox(v));};g.prototype.stox = function (v) {var i = +v;return (i === i) ? i : v;};return f;})();
var o = GET(require("fs").readFileSync("/dev/stdin", "utf8"));

console.log(main());
function main(){
    var l1 = o.getArray(0);
    var A = l1[0];
    var B = l1[1];

    var x, y;
    if (A >= B) {
        x = A;
        y = B;
    } else {
        x = B;
        y = A;
    }

    var r = x % y;
    while(r!=0){
        x = y;
        y = r;
        r = x % y;
    }

    var max = y;

    var divisors = makeDivisors(max);

    var results = [];
    for(var i = 0; divisors.length > i; i++) {
        if (max%divisors[i] === 0) {
            results.push(i);
        }
    }

    return results.length;
}


function makeDivisors(num) {
    var divisors = [1];

    var nums = Array.from((new Array(Math.floor(Math.pow(num, 0.5)) + 1)).keys());

    for (var i = 0; nums.length > i; i++) {
        var n = i + 1;
        if (num / n === 0) {
            if (isPrime(n)) divisors.push(n);
        }

        if (n !== num) {
            if (isPrime(n)) divisors.push(Math.floor(num/n) );
        }
    }

    return divisors;
}

function isPrime(num) {
    for(var i = 2; i < num; i++)
        if(num % i === 0) return false;
    return num > 1;
}