#include <bits/stdc++.h>
namespace // my guiding star
{
#define filein(x) freopen(x".in", "r", stdin);
#define fileout(x) freopen(x, "w", stdout);
#define fileerr(x) freopen(x, "w", stderr);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef unsigned u32;
template <typename T>
using pr = pair<T, T>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd; 
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "Yes" : "No");}
}
int n, m;
ll ans;
void dfs2(int a, int b, int c, int d, int v)
{
	static auto div = [&](int a, int b) -> int{return b ? a / b : 1e9;};
	ans += max(0, min(div(n-a, b), div(n-c, d)) - v + 1);
	ans += min(div(m-a, b), div(n-c, d)) - v + 1;
	for (int u=1; ; u++)
	{
		if ((c + 2 * a * u + (d + 2 * b * u) * max(u, v) > m) || (a + b * max(u ,v) > n)) break;
		dfs2(c + 2 * a * u, d + 2 * b * u, a, b, max(u, v));
	}
}
void dfs1(int x, int y, int v)
{
	for (int u=1; ; u++)
	{
		if ((x + 2 * max(u+1, v) * (y + 2 * u * x) > m) || (y + 2 * u * x > n)) break;
		dfs1(y + 2 * u * x, x, max(u+1, v));
	}
	dfs2(y, 2 * x, x, 0, v);
}
int main()
{
	scanf("%d%d", &n, &m);
	if (n > m) swap(n, m);
	dfs1(1, 0, 1);
	printf("%lld\n", ans);
	return 0;
}