#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

ll f(ll a,ll x, ll lim){
  if(a==1) return 1;
  ll r=1;
  rep(i,x) {
    r*=a;
    if(r>lim){
      r=-1; break;
    }
  }
  return r;
}

int main(){
  ll A,B; cin >> A >> B; if(A<B) swap(A,B);
  if(A==B) cout << "Yes" << endl;
  else{
    if(A%B==0 && A/B<=62 && f(B,A/B,A)==A) cout << "Yes" << endl;
    else cout << "No" << endl;
  }
  return 0;
}