#include <iostream>
using namespace std;
 
int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}
 
int main() {
    int x0, y0;
    cin >> x0 >> y0;
  
    int n = y0 / x0;
 
    int count = 0;
    for (int k1 = 1; k1 * k1 <= n; ++k1) {
        if (n % k1 == 0) {
            int k2 = n / k1;
            if (gcd(k1, k2) == 1) {
                if (k1 != k2) {
                    count += 2;
                } else {
                    count += 1;
                }
            }
        }
    }
 
    cout << count << endl;
    return 0;
}