#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll mod = 998244353;
int n;

using ULL = unsigned long long;
struct BarrettReduction {
  ULL MOD;
  __int128 m;

  BarrettReduction(ULL MOD_): MOD(MOD_) {
    m = (__int128(1)<<64) / MOD;
  }

  ULL reduce(ULL x) const {
    ULL q = (x*m)>>64;
    x -= q * MOD;
    return x < MOD? x: x-MOD;
  }
};

ll extgcd(ll a, ll b) {
  ll x0 = 1, x1 = 0, y0 = 0, y1 = 1;
  while (b != 0) {
    ll q = a / b;
    ll r = a % b;
    ll x2 = x0 - q * x1;
    ll y2 = y0 - q * y1;
    a = b;
    b = r;
    x0 = x1;
    x1 = x2;
    y0 = y1;
    y1 = y2;
  }
  return x0;
}

ULL crt(ll r1, ll m1, ll r2, ll dpq1, BarrettReduction br2, BarrettReduction br3) {
  ULL temp = br2.reduce((r2 - r1) * dpq1);
  return br3.reduce(r1 + m1 * temp);
}

ll pw(ll a, ll b) {
  ll x = 1;
  while (b > 0) {
    if ((b & 1) == 1) {
      x = x * a;
    }
    a = a * a;
    b >>= 1;
  }
  return x;
}

int main() {
  cin.tie(0)->sync_with_stdio(false);
  cin >> n;
  ll m;
  cin >> m;
  m += 2;
  ll p3 = pw(3, n);
  ll p4 = pw(4, n);
  ll p6 = pw(6, n);
  ll p12 = p3 * p4;
  BarrettReduction br4(p4);
  BarrettReduction br6(p6);
  BarrettReduction br12(p12);
  ll dpq1 = extgcd(p3, p4);
  unordered_map<ULL, vector<ULL>> mp;
  for (ll v3 = 0; v3 < p3; v3 += 3) {
    ll v4 = 0;
    ll v6 = 0;
    ll tmp = v3;
    ll pc4 = 4;
    ll pc6 = 6;
    for (int i = 1; i < n; i++) {
      tmp /= 3;
      v4 += tmp % 3 * pc4;
      v6 += tmp % 3 * pc6;
      pc4 *= 4;
      pc6 *= 6;
    }
    ULL v12 = crt(v3, p3, v4, dpq1, br4, br12);
    ULL diff = br6.reduce(v12 - v6 + p6);
    mp[diff].push_back(v12);
  }
  ll ans = 0;
  for (auto &[k, vv]: mp) {
    sort(vv.begin(), vv.end());
    ULL last = vv[vv.size() - 1];
    for (ULL v : vv) {
      if (v + p12 > last + m) {
        ans++;
      }
      last = v + p12;
    }
  }
  cout << ans << endl;
}