#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = (1 << 22) + 520;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
  long long res = 1;
  a %= mod;
  if (b < 0) return 1;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int a[maxn], all;
bool in[maxn], vis[maxn];
void dfs(int u) {
  if (vis[u]) return;
  vis[u] = true;
  if (in[u]) dfs(all ^ u);
  for (int i = 0; i < (22); ++i) {
    if (u & (1 << i)) {
      int v = u ^ (1 << i);
      if (vis[v]) continue;
      dfs(v);
    }
  }
}
int main() {
  int n, m, ans = 0;
  scanf("%d%d", &n, &m);
  all = (1 << n) - 1;
  for (int i = 1; i < (m + 1); ++i) scanf("%d", a + i), in[a[i]] = true;
  for (int i = 1; i < (m + 1); ++i)
    if (!vis[a[i]]) {
      vis[a[i]] = true;
      ans++;
      dfs(all ^ a[i]);
    }
  printf("%d", ans);
  return 0;
}
