#include<stdio.h>
long long int h[200005], l;
long long int comp_h(long long int a, long long int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	swap_h(0, --l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int sqrt(long long int n)
{
	long long int min, mid, max;
	min = -1;
	max = 1;
	while(max * max < n)
		max *= 2;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (mid * mid < n)
			min = mid;
		else
			max = mid;
	}
	return max;
}
int main()
{
	long long int k, n;
	scanf("%lld %lld", &k, &n);
	long long int x, y, z, m;
	l = 0;
	for (x = 1; x * x * x * x * x * x < n; x++)
	{
		for (y = 1; x * x * x * x * x * x + y * y * y * y <= n; y++)
		{
			m = x * x * x * x * x * x + y * y * y * y;
			if (m % k > 0)
				continue;
			z = sqrt(m / k);
			if (k * z * z == m)
				push(m);
		}
	}
	long long int ans = 0;
	if (l > 0)
	{
		x = pop();
		ans++;
	}
	while (l > 0)
	{
		y = pop();
		if (y != x)
			ans++;
		x = y;
	}
	printf("%lld\n", ans);
	return 0;
}