#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef long double ld;
#define sz(c) ((ll)(c).size())
#define ALL(x) x.begin(),x.end()
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define BS(A,x) binary_search(ALL(A),x)
#define rep(i,a,b) for(int i=a;i<b;i++)
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
using vi = vector<int>; 
using vvi = vector<vi>; 
using li =vector<ll>;
using lli=vector<li>;
const long long mod=998244353;
ll Sqrt(ll N){
	ll a=1;ll b=2e9;
	while(b-a>1){
		ll mid=(a+b)/2;
		if(mid*mid>N)b=mid;
		else a=mid;
	}
	return a;
}
int main() { 
  //cout<<Sqrt(4)<<" "<<Sqrt(10)<<endl;
	ll k,n;cin>>k>>n;
	set<ll>ans;
	for(ll i=1;i*i*i*i*i*i<=n;i++){
		ll p=i*i*i*i*i*i;
		for(ll j=1;j*j*j*j+p<=n;j++){
		  ll P=p;
			P+=j*j*j*j;
			if(P>n)continue;
			if(P%k!=0)continue;
			P/=k;
			ll q=(ll)(Sqrt(P));
			if(q*q==P)ans.insert(P);
		}
	}
	cout<<sz(ans)<<endl;
}