int n, m;
    cin >> n >> m;
    int p = INF;
    for(int i = 2; i < (int)10; i++) {
        int l = 0, r = INF;
        while(r - l > 1) {
            int mid = (r + l) >> 1;
            int ans = mid * (i / 2);
            if(i % 2) ans += mid / 2;
            if(ans >= m) r = mid;
            else l = mid;
        }
        p = min(p, 2 * i + 2 * r);
    }
    cout << p;