#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  ll k, n;
  cin >> k >> n;
  set<ll> st;
  for (ll x = 1; x*x*x*x*x*x <= n; ++x) {
    for (ll y = 1; y*y*y*y <= n-x*x*x*x*x*x; ++y) {
      ll v = x*x*x*x*x*x + y*y*y*y;
      if (v % k != 0) continue;
      v /= k;
      ll sv = ll(sqrtl(v));
      if (v == sv*sv)  {
        st.emplace(v*k);
      }
    }
  }
  cout << len(st) << endl;
  return 0;
}