#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll mod = 998244353;
// cope counter = 2254

ll n, m, ans;
inline void bk(int a, int b, int kb) {
	if(max(a, b) > max(n, m) || min(a, b) > min(n, m)) return;
	if(kb & 1 && b <= n) ans += (m - a) / (2 * b);
	if(kb & 1 && b <= m) ans += (n - a) / (2 * b);
	if(kb & 2 && a <= n) ans += (m - b) / (2 * a);
	if(kb & 2 && a <= m) ans += (n - b) / (2 * a);
	if(kb & 1) for(int i = 1; b + 2 * (a + 2 * i * b) <= max(n, m); i++) bk(a + 2 * i * b, b, 2);
	if(kb & 2) for(int i = 1; a + 2 * (b + 2 * i * a) <= max(n, m); i++) bk(a, b + 2 * i * a, 1);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	bk(1, 2, 3);
	cout << ans + 2 << "\n";
}