#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long floorSqrt(long long x) {
	const long long INF = 1e9;
	if (x < 0)return -1;
	long long ok = 0;
	long long ng = 3 * (long long)INF + 1;
	while (1 < abs(ok - ng)) {
		long long c = (ng + ok) / 2;
		auto check = [&]() {
			return c * c <= x;
		};
		if (check()) ok = c;
		else ng = c;
	}
	return ok;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long k, n; cin >> k >> n;
	set<long long>x, y;
	for (long long i = 1;; ++i) {
		long long p = i * i * i * i * i * i;
		if (p > n)break;
		x.insert(p);
	}
	for (long long i = 1;; ++i) {
		long long p = i * i * i * i;
		if (p > n)break;
		y.insert(p);
	}
	//int ans = 0;
	set<long long>ans;
	for (auto e : x)for (auto e2 : y) {
		if (e + e2 <= n && 0 == (e + e2) % k) {
			auto z = floorSqrt((e + e2) / k);
			z *= z;
			z *= k;
			if (z == e + e2) ans.insert(e + e2);
		}
	}
	cout << ans.size() << endl;
	return 0;
}