#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}


string ans,s = "";
void tec(string s,ll i) {
    if (i == 1) {
        ans = s;
        return;
    }
    
    i--;
    if (i % 2 == 0) tec(s+'A',i/2); 
    if (i % 3 == 0)  tec(s + 'B', i/3);  
}



int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        ll k, n;
        cin >> k >> n;
        set<ll>s;
        for (ll i = 1; i * i * i * i * i * i <= n; i++) {
            ll a = i * i * i * i * i * i;
            for (ll j = 1; j * j * j * j <= n; j++) {
                ll b = j * j * j * j;
                if (a + b > n)break;
                if ((a + b) % k)continue;
                ll m = (a + b) / k;
                ll x = sqrt(m);
                if(x*x==m)s.insert(x);
                //cout << i<<" "<<j << endl;
            }
        }
        cout << s.size();
    }
        return 0;
}