#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;


template<class T>
vector<pair<T, int>> factorize(T x) {
  vector<pair<T, int>> res;
  for(T p = 2; p * p <= x; p++) {
    int cnt = 0;
    while(x % p == 0) x /= p, cnt++;
    if (cnt) res.emplace_back(p, cnt);
  }
  if (x > 1) res.emplace_back(x, 1);
  return res;
}


bool solve() {
  string a_str, b_str;
  cin >> a_str >> b_str;
  bool b_minus = b_str[0] == '-';
  if (b_minus) b_str.erase(b_str.begin());
  int a = 0, b = 0;
  for (char c : a_str) if (c != '.') a = 10 * a + (c - '0');
  for (char c : b_str) if (c != '.') b = 10 * b + (c - '0');
  if (!b_minus) {
    if (a % 10000) return false;
    a /= 10000;
  } else {
    if (10000 % a) return false;
    a = 10000 / a;
  }
  int d = 0;
  for (auto [p, e] : factorize(a)) {
    d = gcd(d, e);
  }
  return (ll)d * b % 10000 == 0;
}
} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << (solve() ? "Yes\n" : "No\n");
}