#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, j, n) for (int i = (int)j; i < (int)n; i++)
using ll = long long int;

int main() {
  ll k, n;
  cin >> k >> n;
  vector<ll> x, y, z;
  for (int i = 1; (ll)i*i*i*i*i*i <= n; i++)
    x.push_back((ll)i*i*i*i*i*i);
  for (int i = 1; (ll)i*i*i*i <= n; i++)
    y.push_back((ll)i*i*i*i);
  set<pair<ll, ll>> ans;
  for (ll xi : x) {
    for (ll yi : y) {
      if (xi + yi > n)
	continue;
      if ((xi + yi) % k == 0) {
	ll zi = pow((xi + yi) / k, 0.5);
	if (zi * zi == (xi + yi) / k ||
	    (zi - 1) * (zi - 1) == (xi + yi) / k ||
	    (zi + 1) * (zi + 1) == (xi + yi) / k) {
	  if (xi < yi)
	    ans.insert({xi, yi});
	  else
	    ans.insert({yi, xi});
	}
      }
    }
  }
  cout << ans.size() << endl;
  return 0;
}