#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

ll ll_pow(ll a, ll n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res *= a;
        a = a * a;
        n >>= 1;
    }
    return res;
}

array<int,15> itoar(ll i) {
    array<int,15>res;
    for(int j = 0; j < 15; j++) {
        res[14 - j] = i % 3;
        i /= 3;
    }
    return res;
}

ll artoi(array<int,15> a, ll e) {
    ll res = 0;
    for(int j = 0; j < 15; j++) {
        res *= e;
        res += a[j];
    }
    return res;
}

pair<ll, ll> extgcd(ll a, ll b) {
    ll s = a, xs = 1, ys = 0, t = b, xt = 0, yt = 1;
    while (true) {
        ll temp = s / t;
        if(temp * t != s)break;
        ll u = s - t * temp;
        ll xu = xs - xt * temp;
        ll yu = ys - yt * temp;

        s = t;
        xs = xt;
        ys = yt;
        t = u;
        xt = xu;
        yt = yu;
    }

    return {xt, yt};
}

ll crt(ll a, ll mod1, ll b, ll mod2) {
    auto [p, q] = extgcd(mod1, mod2);
    ll mod = (mod1 * mod2);
    return ((a + mod1 * ((b - a) * p % mod2)) % mod + mod) % mod;
}

int main(){
    ll n, m;
    cin >> n >> m;

    const ll pow3 = ll_pow(3, n);
    const ll pow4 = ll_pow(4, n);
    const ll pow6 = ll_pow(6, n);
    const ll pow12 = ll_pow(12, n);

    vector<pair<ll,ll>> res;

    for(int i = 0; i < pow3; i += 3) {
        // i
        array<int,15> ret = itoar(i);
        ll i3 = i;
        ll i4 = artoi(ret, 4);
        ll i6 = artoi(ret, 6);

        ll t = crt(i3, pow3, i4, pow4);

        i6 = ((i6 - t) % pow6 + pow6) % pow6;

        res.emplace_back(i6, t);

        // i + 1
        res.emplace_back(i6, t + 1);

        // i + 2
        res.emplace_back(i6, t + 2);
    }

    sort(res.begin(), res.end());
    ll ans = 0;

    ll nw = -1, lt = -1;
    for(int i = 0; i < (int)res.size(); i++) {
        if(nw != res[i].first){
            nw = res[i].first;
            lt = res[i].second + pow12;
        }

        if(i + 1 == res.size() || res[i].first != res[i + 1].first) {
            ans += (lt - res[i].second > m) ? 1 : 0;
        }else{
            ans += (res[i+1].second - res[i].second > m) ? 1 : 0;
        }
    }

    cout << ans << endl;
}