#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD =  998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];




inline ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }
int main() {
    cin >> n >> m;
    set<int> st;
    for (int i = 1; i < n + 1; i++) st.insert(qmi(i, m, n));
    puts(st.size() == n && *st.begin() == 0 && *st.rbegin() == n - 1 ? "Yes" : "No");
    return 0;
}