#include<iostream>

 #include<vector>

 #include<queue>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<set>

 #include<cmath>

 using namespace std;

 typedef pair<int, int> Pair;

 typedef long long ll;

 const int INF = 0x3f3f3f3f;

 const int maxn = +;

 int T, n, m;

 ll pow(ll a, ll b, ll m)

 {

     ll ans = ;

     while(b)

     {

         if(b & )ans = (ans % m) * (a % m) % m;

         b /= ;

         a = (a % m) * (a % m) % m;

     }

     ans %= m;

     return ans;

 }

 bool noprime(int x)

 {

     for(int i = ; i <= (int)sqrt(x + 0.5); i++)

     {

         if(x % i == )return true;

     }

     return false;

 }

 int main()

 {

     int p, a;

     while(cin >> p >> a && (p + a))

     {

         if(noprime(p) && pow(a, p, p) == a)cout<<"yes"<<endl;

         else cout<<"no"<<endl;

     }

 }