#include <bits/stdc++.h>
using namespace std;
template <class T>
using vv = vector<vector<T>>;
template <class T>
ostream &operator<<(ostream &os, const vector<T> &t) {
  os << "{";
  for (int(i) = 0; (i) < (t.size()); ++(i)) {
    os << t[i] << ",";
  }
  os << "}" << endl;
  return os;
}
template <class T, size_t n>
ostream &operator<<(ostream &os, const array<T, n> &t) {
  os << "{";
  for (int(i) = 0; (i) < (n); ++(i)) {
    os << t[i] << ",";
  }
  os << "}" << endl;
  return os;
}
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &t) {
  return os << "(" << t.first << "," << t.second << ")";
}
template <class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
  return os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class S, class T, class U, class V>
ostream &operator<<(ostream &os, const tuple<S, T, U, V> &t) {
  return os << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ","
            << get<3>(t) << ")";
}
template <class T>
inline bool MX(T &l, const T &r) {
  return l < r ? l = r, 1 : 0;
}
template <class T>
inline bool MN(T &l, const T &r) {
  return l > r ? l = r, 1 : 0;
}
const long long MOD = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(m);
  for (int(i) = 0; (i) < (m); ++(i)) cin >> a[i];
  vv<int> g((1 << n));
  for (int x : a) g[x].push_back(x ^ ((1 << n) - 1));
  vector<int> usd(1 << n);
  vector<int> ina(1 << n);
  for (int x : a) ina[x] = 1;
  int re = 0;
  for (int v : a)
    if (MX(usd[v], 1)) {
      ++re;
      queue<int> que;
      que.emplace(v);
      while (que.size()) {
        int v = que.front();
        que.pop();
        for (int(j) = 0; (j) < (n); ++(j))
          if (v >> j & 1) {
            int w = v ^ (1 << j);
            if (MX(usd[w], 1)) que.emplace(w);
          }
        if (ina[v]) {
          int w = v ^ ((1 << n) - 1);
          if (MX(usd[w], 1)) que.emplace(w);
        }
      }
    }
  cout << re << endl;
  return 0;
}
