#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
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());

set<array<int,2>> vis;
vector<array<int,2>> stk;

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	int n, m; cin >> n >> m;
	
	int cnt = 0;
	
	stk.push_back({1,2});
	while (sz(stk)) {
		int a = stk[sz(stk)-1][0];
		int b = stk[sz(stk)-1][1];
		stk.pop_back();
		if (a > max(n,m) || b > max(n,m)) continue; 
		if (vis.count({a,b})) continue;
		vis.insert({a,b});
		if (a <= n && b <= m) cnt++;
		stk.push_back({b,a});
		stk.push_back({a+2*b,b});
	/*	if (a > 2*b) {
			stk.push_back({a-2*b,b});
		} */
	}
	cout<<cnt;
	
	return 0;
}