using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Numerics;

class Myon
{
    //chokudaiさんのコードをコピペ
    static Scanner cin;
    public Myon() { }
    public static int Main()
    {
        //Console.SetOut(new Printer(Console.OpenStandardOutput()));
        cin = new Scanner();
        new Myon().calc();
        Console.Read();

        return 0;
    }


    public static long gcd2(long a, long b)
    {
        if (a <= 0) return -1;
        if (a == 0) return b;
        return gcd2(b, a % b);
    }
    public void calc()
    {
        long a = cin.nextLong();
        long b = cin.nextLong();

        long temp = SMath.Gcd(a, b);
        //Console.WriteLine(temp);
        long max = (long) Math.Sqrt(temp);
        int i = 2;
        List<long> fact = SMath.Factorization(temp).Distinct().ToList<long>();
        int ans = fact.Count + 1;
        Console.WriteLine(ans);
    }
    //public void calcD()
    //{
    //    long a = cin.nextLong();
    //    long b = cin.nextLong();

    //    long gcd2 = Gcd(a, b);
    //    int count = 0; //公約数のもつ素因数の数　ただし重複は数えない　12 なら 2(2^2 3 )だが3でない
    //    int temp = 1;
    //    long max = (long)Math.Sqrt(gcd2);
        
    //    while (gcd2 != 1)
    //    {
    //        temp++;
    //        if (gcd2 % temp == 0)
    //        {
    //            count++;
    //            while (gcd2 % temp == 0) gcd2 /= temp;
    //        }
    //        else if (temp > max) { count++; break; }
    //    }
        

    //    showL(count + 1);
    //}


    

    public void backetSort(ref int[] a)
    {
        //max a << a.len に対して有効なソート
        //よってa = int[] とする
        long n = a.Length;
        var count = new int[n];
        var loc = new long[n];//loc[i] は i が終わる 位置 max index where c[index] = loc[i]
        for (long i = 0; i < n; i++) count[a[i]]++;
        loc[0] = count[0] - 1;
        for (long i = 0; i < n-1; i++) loc[i+1] = loc[i] + count[i+1]; 
        long index = 0;

        for(int i = 0; i < n; i++)
        {
            while (index <= loc[i]) a[index++] = i; //incex <= loc[i] == index < loc[i] + 1
        }
    }

    public static void showL(long n) { Console.WriteLine(n); }
    public static void showL(string s) { Console.WriteLine(s); }
}

class Printer : StreamWriter
{
    public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
    public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { }
}

class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        while (i >= s.Length)
        {
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
        }
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }

}

class SMath
{
    public static List<long> Factorization(long n)
    {
        List<long> output = new List<long>();
        int i = 2;
        long max = (long)Math.Sqrt(n); ;
        while(n > 1)
        {
            if(i > max) { output.Add(n);break; }
            while (n % i == 0)
            {
                output.Add(i);
                n /= i;
            }
            i++;
        }
        return output;
    }
    public static long Gcd(long a, long b)
    {
        if (a <= 0) return -1;
        //if (a > b) return gcd(b, a);
        if (b == 0) return a;
        return Gcd(b, a % b);
    }
}

Measured memory_bytes: 13280