#include <bits/stdc++.h>
using namespace std;
long long g[49];
long long n, m;
long long f[49], siz[49];
long long getfa(long long x) { return f[x] == x ? x : f[x] = getfa(f[x]); }
void hebin(long long x, long long y) {
  long long fx = getfa(x), fy = getfa(y);
  if (fx != fy) f[fx] = fy, siz[fy] += siz[fx];
}
long long check(long long u) {
  long long vis[49];
  memset(vis, 0, sizeof(vis));
  vis[u] = 1;
  queue<long long> q;
  while (!q.empty()) q.pop();
  q.push(u);
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    for (long long i = 0; i < n; i++)
      if (g[u] & (1ll << i)) {
        if (vis[i] == 0)
          vis[i] = 3 - vis[u], q.push(i);
        else if (vis[i] != 3 - vis[u])
          return 0;
      }
  }
  return 2;
}
long long solve1() {
  long long cnt = 1, cnt2 = 1;
  for (long long i = 0; i < n; i++)
    if (f[i] == i) {
      cnt <<= 1;
      cnt2 *= check(i);
    }
  return -cnt + cnt2;
}
long long lef[1 << 21];
void dfs1(long long st, long long ed, long long zt, long long lim) {
  if (st == ed) {
    lef[zt]++;
    return;
  }
  dfs1(st + 1, ed, zt, lim);
  if (((1ll << st) & lim) == 0) dfs1(st + 1, ed, zt | (1ll << st), lim | g[st]);
}
long long dfs2(long long st, long long ed, long long zt, long long lim) {
  if (st == ed) {
    zt &= lim;
    zt ^= lim;
    return lef[zt];
  }
  long long ans = dfs2(st + 1, ed, zt, lim);
  if ((zt & (1ll << st)) == 0) ans += dfs2(st + 1, ed, zt | g[st], lim);
  return ans;
}
long long solve2() {
  long long mid = n / 2, lim = (1ll << mid) - 1;
  dfs1(0, mid, 0, 0);
  for (long long i = 0; i < mid; i++)
    for (long long j = 0; j <= lim; j++)
      if (j & (1ll << i)) lef[j] += lef[j ^ (1ll << i)];
  return dfs2(mid, n, 0, lim);
}
signed main() {
  cin >> n >> m;
  for (long long i = 0; i < n; i++) f[i] = i, siz[i] = 1;
  for (long long i = 1, u, v; i <= m; i++)
    cin >> u >> v, u--, v--, g[u] |= (1ll << v), g[v] |= (1ll << u),
        hebin(u, v);
  long long ans = 1ll << n;
  if (m == 0) ans = 0;
  long long cnt = 0;
  for (long long i = 0; i < n; i++) {
    if (g[i] == 0) cnt++;
  }
  ans += (1ll << cnt + 1);
  ans += solve1();
  ans -= solve2() * 2;
  cout << ans << endl;
  return 0;
}
