#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>


using namespace std;
typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

ll power(ll x, ll n) {
	if (n == 0) {
		return 1;
	}
	if (n % 2 == 0) {
		return power(x * x, n / 2);
	}
	else {
		return x * power(x, n - 1);
	}
}
ll nsq(ll X, int n) {
	ll t = pow(X, 1.0 / (double)n);
	ll res = -1;
	for (ll i = max(0LL, t - 5); i <= t + 5; i++) if (power(t, n) <= X) res = t;
	return res;
}
int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, z; cin >> n >> z;
	if (n >= 3) {
		cout << "No" << endl;
	}
	else {
		ll zn = 1; for (int i = 0; i < n; i++) zn *= z;
		for (ll x = 1;; x++) {
			if (power(x, n) >= zn) {
				cout << "No" << endl;
				return 0;
			}
			ll yn = zn - power(x, n);
			ll y = nsq(yn, n);
			if (y > 0 and power(y, n) == yn) {
				cout << "Yes" << "\n";
				return 0;
			}
		}
	}
	return 0;
}