#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;
using ll = long long;

const int INF = 100100100;

ll gcd(ll a , ll b){
    if(a < b)swap(a , b);
    if(a % b == 0)return b;
    else return gcd(b , a % b);
}

int main(){
    int d1 , d2;
    cin >> d1 >> d2;
    if(d1 == d2 || 2*d1 == d2){
        cout << 4 << endl;
        exit(0);
    }
    if(d1 < d2 && d2 < 2*d1){
        cout << 8 << endl;
        exit(0);
    }
    cout << 0 << endl;
    return 0;
}