import std.stdio, std.algorithm, std.array, std.conv, std.typecons;

void main() {
	auto tmp = readln.split.to!(uint[]);
	auto N = tmp[0], M = tmp[1];
		
	bool[uint] Aset;
	foreach (i; 1 .. N+1) {
		Aset[pow_mod(i, M, N)] = true;
	}
	writeln(Aset.length == N ? "Yes" : "No");
}

// (i ^^ p) % n for i > 0
uint pow_mod(uint i, uint p, uint n) {
	uint result = 1;
	foreach (_; 0 .. p) {
		result = (result * i) % n;
	}
	return result;
}