#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define out(x) cout<<x<<'\n'
#define all(v) v.begin(),v.end()
#define rep(i,n) for(int i=0;i<(ll)(n);i++)
template<class T> inline bool chmin(T& a, T b) {if(a > b){a = b; return true;} else {return false;}};
template<class T> inline bool chmax(T& a, T b) {if(a < b){a = b; return true;} else {return false;}};
const ll INF=(1LL<<60);
const ll mod=998244353;
using Graph = vector<vector<ll>>;
using Network = vector<vector<pair<ll,ll>>>;
using Grid = vector<string>;
const vector<ll> dx = {0, 1, 0, -1};
const vector<ll> dy = {1, 0, -1, 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; y++) {
            ll n = x*x*x*x*x*x + y*y*y*y;
            if(n % K != 0) continue;
            n = n / K;
            ll z = sqrt((ld)n);
            if(z*z != n) continue;
            st.insert(n);
        }
    }
    out(st.size());
}