#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m;
  std::cin >> n >> m;

  std::vector vis(std::max(n, m) + 1, std::vector<bool>(std::max(n, m) + 1));
  int64_t ans = 0;
  auto next = [&](int a, int b) -> std::vector<std::pair<int, int>> {
    std::vector<std::pair<int, int>> ans{{b, a}, {a + 2 * b, b}};
    if (a > 2 * b) {
      ans.emplace_back(a - 2 * b, b);
    }
    return ans;
  };
  auto dfs = [&](auto &self, int a, int b) -> void {
    if (1 <= a && a <= n && 1 <= b && b <= m) {
      ++ans;
    }
    for (auto [na, nb] : next(a, b)) {
      if (1 <= na && na <= std::max(n, m) && 1 <= nb && nb <= std::max(n, m) && !vis[na][nb]) {
        vis[na][nb] = true;
        self(self, na, nb);
      }
    }
  };
  vis[1][2] = true;
  dfs(dfs, 1, 2);
  std::cout << ans << '\n';
}