#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// 素因数分解
std::vector<std::pair<long long, int>> primeFactorization(long long n) {
	std::vector<std::pair<long long, int>> ret;
	for (long long i = 2; i*i <= n; i++) {
		int c = 0;
		while (n%i == 0) { // 素数で割り切れなくなるまで割っていく
			c++;//割った個数を配列に足す
			n /= i;
		}
		if (0 != c) ret.push_back({ i,c });
		if (1 == n) break;
	}
	if (1 != n) ret.push_back({ n,1 });
	return ret;
}
map<long long, long long> f(string s) {
	long long x = 0;
	int cnt = 0;
	rep(i, s.size()) {
		if (s[i] == '.') {
			rep2(j, i + 1, s.size()) cnt++;
			continue;
		}
		x = x * 10 + s[i] - '0';
	}
	auto get = primeFactorization(x);
	map<long long, long long>mp;
	for (auto[p, q] : get)mp[p] = q;
	if (cnt) {
		mp[2] -= cnt;
		mp[5] -= cnt;
	}
	return mp;
}
std::pair<long long, long long>g(string s) {
	long long p = 0;
	long long q = 1;
	rep(i, s.size()) {
		if ('-' == s[i]) continue;
		if ('.' == s[i]) {
			rep2(j, i + 1, s.size()) q *= 10;
			continue;
		}
		p = p * 10 + s[i] - '0';
	}
	if (s.front() == '-')p *= -1;
	long long g = abs(gcd(p, q));
	p /= g, q /= g;
	return { p, q };
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string a, b; cin >> a >> b;
	auto mp = f(a);
	auto[p, q] = g(b);
	bool chk = true;
	for (auto[k, v] : mp) {
		//cout << k << " " << v << endl;
		if (v == 0)continue;
		if (v < 0 && p > 0) {
			chk = false;
			continue;
		}
		if (v > 0 && p < 0) {
			chk = false;
			continue;
		}
		if (0 != (v * p) % q)chk = false;
	}
	if (chk)cout << "Yes" << endl;
	else cout << "No" << endl;
	//cout << p << " " << q << endl;
	return 0;
}