#include <cstdio>
#include <vector>
#include <algorithm>
struct Element {
	long long u;
	long long cnt;
};
std::vector<Element> getFactor(long long n){
	std::vector<Element> res;
	for(long long i = 2; i*i <= n; i++){
		if(n == 1) break;
		if(n%i==0){
			int cnt = 0;
			while(n%i==0){
				n /= i;
				cnt++;
			}
			res.push_back({i, cnt});
		}
	}
	if(n!=1) res.push_back({n, 1});
	std::sort(res.begin(), res.end(), [](Element& u, Element& v){
		return u.u < v.u;
	});
	return res;
}


int main(){
	long long a,b;
	scanf("%lld%lld",&a,&b);
	std::vector<Element> fa = getFactor(a);
	std::vector<Element> fb = getFactor(b);
	int ok = 1;
	if(fa.size()!=fb.size()) ok = 0;
	for(int i = 0; i < (int)fa.size(); i++){
		if(fa[i].u!=fb[i].u)
			ok = 0;
		if(fa[i].u*b!=fb[i].u*a)
			ok = 0;
	}
	if(ok)
		printf("Yes\n");
	else 
		printf("No\n");
	return 0;
}