#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int M, N;
Int ans;

void dfs(int a, int b) {
  if (a + a + b > N) {
    // a + 2 k b <= M
    ans += (M - a) / (b + b) + 1;
  } else if (a + b + b > M) {
    // 2 k a + b <= N
    ans += (N - b) / (a + a) + 1;
  } else {
    ++ans;
    dfs(a, a + a + b);
    dfs(a + b + b, b);
  }
}

int main() {
  for (; ~scanf("%d%d", &M, &N); ) {
    ans = 0;
    dfs(1, 2);
    dfs(2, 1);
    printf("%lld\n", ans);
  }
  return 0;
}