#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>

using namespace std;

long pow(long x, long n) {
    long ans = 1;
    while (n > 0) {
        if ((n & 1) == 1) {
            ans = ans * x;
        }
        x = x * x;
        n = n >> 1;
    }
    return ans;
}

int main() {

    int L, N;
    cin >> L >> N;
    set<string> st;
    for (int i = 0; i < N; ++i) {
        string S;
        cin >> S;
        st.insert(S);
    }
    long long res = 0;
    for (string s : st) {
        res += pow(2, L - 3);
    }

    cout << res << endl;
    return 0;
}