#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
static const double pi = 3.141592653589793;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll imod = 998244353;
using mint = modint998244353;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
ll P(ll x, ll n, ll p) {
  ll ret = 1;
    while (n > 0) {
      if (n & 1){
      	ret *= x;
      	ret %= p;
      }
      x *= x;
      x %= p;
      n >>= 1;
  }
  return ret;
}

void seek(bool f){
  cout << (f ? "Yes" : "No") << endl;
}

int main(){
	ll N, M;
	cin >> N >> M;
	set<ll> st;
	for(ll i = 1; i <= N; i++){
		st.insert(P(i, M, N));
	}
	cout << (st.size() == N ? "Yes" : "No") << endl;
}