poj 3641

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define ms(a,b) memset(a,b,sizeof(a))

using namespace std;



bool isp(ull x) {
	for (ull i = 2; i*i <= x; i++)
		if (x%i == 0)return false;
	return true;
}

ull mpow(ull a, ull p) {
	ull mod = p;
	ull res = 1;
	while (p) {
		if (p & 1) res = (res*a) % mod;
		a = (a*a)%mod;
		p >>= 1;
	}
	return res;
}

ull p, a;

int main() {
	while (cin >> p >> a, p != 0) {
		if (isp(p)) cout << "no" << endl;
		else 
			if (mpow(a, p)==a%p) cout << "yes" << endl;
			else cout << "no" << endl;
	}

	return 0;
}