//#pragma comment(linker,"/STACK:327680000,327680000")
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
#include <string>
#include <set>
#include <functional>
#include <numeric>
#include <sstream>
#include <stack>
#include <map>
#include <queue>#define CL(arr, val)    memset(arr, val, sizeof(arr))#define lc l,m,rt<<1
#define rc m + 1,r,rt<<1|1
#define pi acos(-1.0)
#define ll long long
#define L(x)    (x) << 1
#define R(x)    (x) << 1 | 1
#define MID(l, r)   (l + r) >> 1
#define Min(x, y)   (x) < (y) ? (x) : (y)
#define Max(x, y)   (x) < (y) ? (y) : (x)
#define E(x)        (1 << (x))
#define iabs(x)     (x) < 0 ? -(x) : (x)
#define OUT(x)  printf("%I64d\n", x)
#define lowbit(x)   (x)&(-x)
#define Read()  freopen("din.txt", "r", stdin)
#define Write() freopen("dout.txt", "w", stdout);#define M 23
#define N 1007
#define chN 50
using namespace std;int n,m;
struct Mat
{int mat[6][6];void init(){CL(mat,0);mat[0][0] = mat[1][1] = 2;mat[0][2] = mat[1][3] = mat[2][3] = mat[2][4] = mat[3][4] = mat[4][5] = mat[5][2] = mat[5][5] = 1;}
}a;Mat operator*(Mat a,Mat b)
{Mat c;int i,j,k;CL(c.mat,0);for (i = 0; i < 6; ++i){for (j = 0; j < 6; ++j){for (k = 0; k < 6; ++k){if (!a.mat[i][k] || !b.mat[k][j]) continue;c.mat[i][j] += a.mat[i][k]*b.mat[k][j];if (c.mat[i][j] > m) c.mat[i][j] %= m;}}}return c;
}
Mat operator^(Mat a,int k)
{Mat c;int i,j;for (i = 0; i < 6; ++i){for (j = 0; j < 6; ++j){c.mat[i][j] = (i == j);}}while (k){if (k&1) c = c*a;k >>= 1;a = a*a;}return c;
}
int main()
{//    Read();int i;while (~scanf("%d%d",&n,&m)){a.init();Mat res;res = a^(n - 1);int ans = 0;for (i = 2; i < 6; ++i){ans += res.mat[i][4] + res.mat[i][5];}printf("%d\n",ans%m);}return 0;
}