/* #region Head */

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvd = vector<vld>;
using vs = vector<string>;
using vvs = vector<vs>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PREM(c)   \
    sort(all(c)); \
    for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

// vector入力
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
    for (T &x : vec)
        is >> x;
    return is;
}

// vector出力
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
    ll len = SIZE(vec);
    os << "{";
    for (int i = 0; i < len; i++)
        os << vec[i] << (i == len - 1 ? "" : ", ");
    os << "}";
    return os;
}

// pair入力
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var)
{
    is >> pair_var.first >> pair_var.second;
    return is;
}

// pair出力
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var)
{
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map出力
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var)
{
    os << "{";
    REPI(itr, map_var)
    {
        os << *itr;
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

// set 出力
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var)
{
    os << "{";
    REPI(itr, set_var)
    {
        os << *itr;
        itr++;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}

// dump
#define DUMPOUT cerr
void dump_func()
{
    DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail)
{
    DUMPOUT << head;
    if (sizeof...(Tail) > 0)
    {
        DUMPOUT << ", ";
    }
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {})
{
    if (comp(xmax, x))
    {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {})
{
    if (comp(x, xmin))
    {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                       \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                     \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
            << endl                                                     \
            << "    ",                                                  \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize
{
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;

    AtCoderInitialize()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH)
            cout << unitbuf;
    }
} ATCODER_INITIALIZE;

/* #endregion */

/* エラトステネスのふるい計算用拡張クラス． */
class SieveEx
{
    ll L, R, M;
    /* 小さい篩．small[i] := i の最小の素因数． */
    vll small;
    /* 大きい篩．半開区間 [L, R) に対応する各要素が vector<ll>. */
    vector<vector<ll>> large;
    /* aux[i] := large[i] の素因数の積． */
    vll aux;

public:
    /* コンストラクタ． */
    SieveEx(ll L, ll R) : L(L), R(R), M(ceil(sqrt(R))), small(vll(M)), large(vector<vector<ll>>(R - L)), aux(vll(R - L, 1))
    {
        // small.resize(M);
        iota(ALL(small), 0);
        // large.resize(R - L);
        // aux.assign(R - L, 1);

        // i * i < R <=> i < sqrt(R)
        // ll m = ceil(sqrt(R));
        // for (ll i = 2; i < m; ++i)
        REP(i, 2, M)
        {
            // 小さい篩の更新
            if (small[i] < i)
                continue;
            small[i] = i;
            // for (ll j = i * i; j < M; j += i)
            REPD(j, i * i, M, i)
            {
                if (small[j] == j)
                    small[j] = i;
            }

            // 大きい篩の更新 (L+i 未満の i の倍数で最大のものから i の倍数をなめる)
            // for (ll j = (L + i - 1) / i * i; j < R; j += i)
            REPD(j, (L + i - 1) / i * i, R, i)
            {
                ll k = j;
                do
                {
                    // aux[j-L] > M で判定した方がいいかも？
                    // j / aux[j-L] < M の方がいい？（割り算したくない）
                    if (aux[j - L] * aux[j - L] > R)
                        break;

                    large[j - L].push_back(i);
                    aux[j - L] *= i;
                    k /= i;
                } while (k % i == 0);
            }
        }
    }

    /* n を素因数分解した結果を返す．n は [L, R) に含まれる整数． */
    vll pfd(ll n)
    {
        assert(L <= n && n < R);
        vll res = large[n - L];
        n /= aux[n - L];
        // cerr << "_" << n << endl;
        if (n >= M)
        {
            // この場合，n は素数となることが示せる（はず）
            // n*n >= R だとオーバーフローしそう？
            // cerr << "+" << n << endl;
            res.push_back(n);
            return res;
        }
        while (n > 1)
        {
            // cerr << "<" << small[n] << endl;
            res.push_back(small[n]);
            n /= small[n];
        }
        return res;
    }
};

/**
Problem
 */
void solve()
{
    ll a, b;
    cin >> a >> b;

    // g の素因数を求めたい
    ll g = __gcd(a, b);
    // dump(g);

    ll n = g;
    SieveEx sieve(n, n + 1);
    vll f = sieve.pfd(n);
    UNIQ(f);

    cout << (1 + SIZE(f)) << endl;
}

/**
 * エントリポイント．
 * @return 0.
 */
int main()
{
    solve();
    return 0;
}


Measured memory_bytes: 8064