#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*

assumes n >= m

*/

int sdiv(int a, int b) {
	//a/b
	return (b==0 ? 1e9 : a/b);
}

int n,m,ans;

void dfs2(int a, int b, int c, int d, int minX) {
	if (a+b*minX > n || c+d*minX > m) return;
	
	int hix = 1e9;
	hix = min(hix, sdiv(n-a,b));
	hix = min(hix, sdiv(m-c,d));
	
	assert(hix >= minX);
	
	ans += (hix-minX)/2+1;
	
	int hix2 = 1e9;
	hix2 = min(hix2, sdiv(m-a,b));
	hix2 = min(hix2, sdiv(n-c,d));
	if (hix2 >= minX) {
		ans += (hix2-minX)/2+1;
	} 
	
	for (int u=2;; u+=2) {
		int tx = max(minX,u);
		int p = a+b*tx, q = c+d*tx;
		if (q+p*u > n || p > m) break;
		dfs2(c+a*u,d+b*u,a,b,tx);
	}
	
}

void dfs1(int p, int q, int minX) {
	if (p>n || q>m) return;
	dfs2(q,p,p,0,minX);
	for (int u=2;; u+=2) {
		int tx = max(minX,u+2);
		if (p+tx*(q+u*p) > n || q+u*p > m) break;
		dfs1(q+u*p,p,tx);
	}
	
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>n>>m;
	if (n<m) swap(n,m);
	
	dfs1(1,0,2);
	cout<<ans;
	
	return 0;
}