#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;

// Mod int
int mod;
struct mint{
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  mint operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
  bool operator==(const mint& a)const{ return x == a.x;}
};
//

map<vi,int> mp;
vvi pm;
vvi to;

void genst() {
  vi a(4);
  rep(i,4) a[i] = i;
  queue<vi> q;
  mp[a] = 0;
  pm = vvi(15);
  pm[0] = a;
  to = vvi(15,vi(1<<4));
  q.push(a);
  while(sz(q)) {
    a = q.front(); q.pop();
    // priv(a);
    int v = mp[a];
    rep(i,1<<4) {
      vi b(4);
      rep(j,4) b[j] = j;
      rep(j,4)rep(k,j) if ((i>>j&1) && (i>>k&1)) {
        int xj = a[j];
        int xk = a[k];
        if (xj > xk) swap(xj,xk);
        // b[xk] = xj;
        mins(b[xk],xj);
      }
      vi c = a;
      rep(j,4) c[j] = b[c[j]];
      rep(j,4) b[j] = -1;
      int cnt = 0;
      rep(j,4) {
        if (b[c[j]] != -1) continue;
        b[c[j]] = cnt++;
      }
      rep(j,4) c[j] = b[c[j]];
      int u = 0;
      if (mp.count(c)) {
        u = mp[c];
      } else {
        u = sz(mp);
        mp[c] = u;
        pm[u] = c;
        q.push(c);
      }
      to[v][i] = u;
    }
  }
}

mint dp[11][15][1<<4][5][90][1<<4];

int main() {
  int n;
  scanf("%d%d",&n,&mod);
  genst();
  // cout<<sz(mp)<<endl;
  dp[0][0][0][0][0][0] = 1;
  rep(i,10)rep(j,15)rep(k,1<<4)rep(l,3)rep(h,77)rep(u,1<<4) {
    mint x = dp[i][j][k][l][h][u];
    if (x.x == 0) continue;
    int ni = i+1;
    rep(f,1<<4)rep(g,1<<4) {
      if (i == 0 && g != f) continue;
      if ((g&f) != g) continue;
      mint p = 1;
      if (i) rep(r,4) if(g>>r&1) p *= 2;
      int nj = to[j][f];
      int nk = k^g;
      int nl = l+pcnt(g)%2;
      int nh = h+pcnt(f)*2-pcnt(g);
      int nu = u|f;
      dp[ni][nj][nk][nl][nh][nu] += x*p;
      // cout<<i<<" "<<j<<" "<<k<<" "<<l<<" "<<h<<" "<<u<<" "<<f<<" "<<g<<endl;
      // cout<<ni<<" "<<nj<<" "<<nk<<" "<<nl<<" "<<nh<<" "<<nu<<" "<<x.x<<" "<<p.x<<endl;
    }
  }
  mint ans = 0;
  rep(j,15)rep(k,1<<4)rep(l,3)rep(u,1<<4) {
    if (pcnt(k)+l > 2) continue;
    vi a = pm[j];
    set<int> s;
    rep(i,4) if (u>>i&1) s.insert(a[i]);
    if (sz(s) == 1) ans += dp[10][j][k][l][n][u];
  }
  cout<<ans.x<<endl;
  return 0;
}