#include<cstdio> #include<algorithm> #include<vector> #include<queue> #include<string> #include<iostream> #include<cmath> #include<map> #include<set> #include<climits> #include<ctime> #include<complex> #include<sstream> #include<cstring> using namespace std; typedef vector<string>vs; typedef vector<int>vi; typedef vector<vi>vvi; typedef vector<double>vd; typedef pair<int,int>pii; typedef long long ll; typedef pair<ll,ll>pll; typedef vector<ll>vl; #define rrep(i,x,n) for(int i=(x);i<(n);++i) #define rep(i,x) rrep(i,0,(x)) #define fi first #define se second #define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i) #define all(c) (c).begin(),(c).end() #define rall(c) (c).rbegin(),(c).rend() #define pb push_back #define maxs(a,b) (a)=max(a,b) #define mins(a,b) (a)=min(a,b) int main(){ int L,N; scanf("%d%d",&L,&N); rep(i,N){ char str[10];scanf("%s",str); } int ans=1; rep(i,L/3-1)ans*=8; cout<<ans*N<<endl; }