#include #include using namespace std; typedef long long ll; const int INF = 1<<30; const ll INFLL = 1LL<<60; const ll MOD = 998244353; const double INFD = 1.0E18; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, -1, 0, 1}; //const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1}; //const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1}; using Pair = pair; using Graph = vector>>; using mint = atcoder::modint1000000007; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); ll k, n; cin >> k >> n; int cnt = 0; set st; for (ll x = 1; x < 1000; x++){ for (ll y = 1; y < 10000; y++){ ll val = x * x * x * x * x * x + y * y * y * y; if (val > n) break; if (val % k != 0) continue; if (val / k == (ll)sqrtl(val / k) * (ll)sqrtl(val / k)) st.insert(val); } } cout << st.size() << endl; return 0; }