#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)






ll MOD;

ll f(ll x,ll n){
    ll res=1;
    while(n!=0LL){
	if(n%2!=0LL) res=(res*x)%MOD;
	x=(x*x)%MOD;
	n/=2;
   }
    return res;
}








int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;


	ll N,M;
	cin >> N >> M;

	MOD=N;

	set<ll> s;
	for(i=1;i<=N;i++){
		s.insert(f(i,M));
	}


	if((ll)s.size()==N) cout << "Yes" << endl;
	else cout << "No" << endl;











	return 0;

}