#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
  long long k, n;
  cin >> k >> n;
  set<long long> st;
  for (long long x = 1; true; ++x)
  {
    long long x6 = x * x * x * x * x * x;
    if (x6 >= n) break;
    for (long long y = 1; true; ++y)
    {
      long long tmp = y * y * y * y + x6;
      if (tmp > n) break;
      if (tmp % k) continue;
      st.insert(tmp / k);
    }
  }
  int ans = 0;
  for (long long z = 1; z * z * k <= n; ++z) ans += (st.find(z * z) != st.end());
  cout << ans << endl;
}