#include <bits/stdc++.h>   using namespace std;   const int MAX = (1 << 22) + 5;   int n, m;   bool is[MAX], seen[MAX];   int conj(int x) {     int r = 0;     for (int i = 0; i < n; ++i)       if (!(x & (1 << i))) r += (1 << i);     return r;   }   void dfs(int st, bool p = 0) {     if (seen[st]) return;     seen[st] = 1;     if (is[st]) dfs(conj(st), 1);     if (p) {       for (int i = 0; i < n; ++i)         if (st & (1 << i)) {           dfs(st - (1 << i), 1);         }     }   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0), cout.tie(0);     cin >> n >> m;     vector<int> st((1 << n) + 1, 0);     vector<bool> lz((1 << n) + 1, 0);     for (int i = 0; i < m; ++i) {       int x;       cin >> x;       is[x] = 1;     }     int cnt = 0;     for (int i = 0; i < (1 << n); ++i) {       if (!seen[i] && is[i]) {         dfs(i);         ++cnt;       }     }     cout << cnt <<   n ;     return 0;   }   