#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 3e5+1;
int n,m,ans,tot,pri[N],phi[N];
ll s[N];
unordered_map<int,int> vis[N];
int f(int i,int j){
    if(i==0 && j==1) return 1; 
    if(i>j) swap(i,j);
    if((j/i)%2 == 0) return f(j%(2*i),i);
    return 0;
}
void dfs(int i,int j){
    if(i>n || j>m || vis[i][j]) return ;
    vis[i][j] = 1,ans++,dfs(j,i),dfs(i+2*j,j);
}
int main(){
    // cin.tie(0),cout.tie(0);
    // ios::sync_with_stdio(0);
    // prework();
    cin >> n >> m;
    if(n<=8000 && m<=8000){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=i/2;j++){
                if(__gcd(i,j) == 1) ans = (ans+f(i,j));
            }
            for(int j=2*i;j<=m;j++){
                if(__gcd(i,j) == 1) ans = (ans+f(i,j));
            }
        }
        cout << ans;
        return 0;
    }
    dfs(1,2);
    cout << ans;
    return 0;
}