#include <iostream>
using namespace  std;

long long p10[100];

long long gcd(long long a,long long b) {
    return a?gcd(b%a,a):b;
}

main() {
    p10[0]=1;
    for (int i=1;i<100;++i) p10[i]=p10[i-1]*10;
    long long a,b;
    cin>>a>>b;
    long long g=gcd(a,b);
    a/=g;
    b/=g;
    while (b%5==0) {
        b/=5;
    }
    while (b%2==0) {
        b/=2;
    }
    if (b!=1) {
        cout<<"Yes"<<endl;
    } else {
        cout<<"No"<<endl;
    }
}