import java.io.*;
import java.util.*;

public class Solution {
    
    static HashMap<Node,Long> h = new HashMap<Node,Long>();
    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        int n = sc.nextInt();
        //dp=new long[m+1][n+1];
        System.out.println(rec(m,n));
    }
    static long rec(int m,int n){
        Node nn = new Node(m,n);
        if(h.containsKey(nn)) return h.get(nn);
        long temp=0;
        if(m==1 || n==1) temp=(m-1)*n + (n-1)*m;
        else if(m<n){
            temp=rec(n,m);
        }
        else temp= 1+ rec(m/2,n)+rec(m-m/2,n);
        h.put(nn,temp);
        return temp;
    }
}
class Node{
    int i;
    int j;
    public Node(int i,int j){
        this.i=i;
        this.j=j;
    }
    @Override
    public boolean equals(Object o){
        Node n = (Node) o;
        return Integer.compare(this.i,n.i)==0 && Integer.compare(this.j,n.j)==0;
    }
    @Override
    public int hashCode(){
        return i/11+99 -j/23;
    }
}