#include <bits/stdc++.h>
using namespace std;

struct UnionFind{
    vector<int> data;
    UnionFind(int n): data(n, -1){}
    bool unite(int a, int b){
        a = root(a); b = root(b);
        if(a == b) return 0;
        if(data[a] > data[b]) swap(a, b);
        data[a] += data[b];
        data[b] = a;
        return 1;
    }
    bool find(int a, int b){ return root(a) == root(b); }
    int root(int a){ return data[a] < 0 ? a : data[a] = root(data[a]); }
    int size(int a){ return -data[root(a)]; }
    int operator[](int a){ return root(a); }
};
int main(){
    int N;
    cin >> N >> N;
    const int mx = 1 << N * 2;
    UnionFind uf(mx);
    auto rotate = [N, mask1 = 1, mask2 = (1 << N) - 2, mask3 = ((1 << N) - 2) << (N - 1), mask4 = mx >> 1](int x){
        const int a = x & mask1, b = x & mask2, c = x & mask3, d = x & mask4;
        return c << 1 | d >> (N - 1) | a << (N - 1) | b >> 1;
    };
    auto reverse = [N, mask1 = (1 << N) - 1, mask2 = ((1 << N) - 1) << N](int x){
        const int a = x & mask1, b = x & mask2;
        return b >> N | a << N;
    };
    int ans = mx;
    for(int i = 0; i < mx; i++) if(uf.unite(i, rotate(i))) ans--;
    for(int i = 0; i < mx; i++) if(uf.unite(i, reverse(i))) ans--;
    cout << ans << endl;
}