#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

#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 dfs(int M, int N) {
  Int ans = 0;
  int a = 2, b = 1;
#define up \
  for (; a > b; a -= b + b) {} \
  if (!a) break; \
  b -= a + a; \
  a += b + b; \
  {}
  for (; ; ) {
    // assert(a <= M);
    // assert(b <= N);
    if (a + a + b > N) {
      // a + 2 k b <= M
      ans += (M - a) / (b + b) + 1;
      up;
    } else if (a + b + b > M) {
      // 2 k a + b <= N
      ans += (N - b) / (a + a) + 1;
      up;
    } else {
      ++ans;
      b += a + a;
    }
  }
  return ans;
}

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