#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const long long N = 45, HALF = 20;
long long n, m, ans[8];
bool good[(1 << HALF) + 5];
long long dp[(1 << HALF) + 5];
vector<long long> g[N];
bool allComponentsBipartie = 0, con[N][N];
long long cntComponents = 0, cntSingle = 0;
bool vis[N];
long long col[N];
void dfs(long long u) {
  vis[u] = 1;
  for (auto v : g[u]) {
    if (!vis[v]) {
      col[v] = col[u] ^ 1;
      dfs(v);
    } else {
      if (col[v] == col[u]) allComponentsBipartie = 0;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  if (m < 3) {
    cout << "0";
    return 0;
  }
  memset(con, 0, sizeof con);
  for (long long i = 0; i < m; i++) {
    long long u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v), g[v].push_back(u);
    con[u][v] = con[v][u] = 1;
  }
  ans[7] = 0;
  for (long long i = 0; i < n; i++)
    if (g[i].size() == 0) cntSingle++;
  ans[3] = (1ll << cntSingle), ans[6] = (1ll << cntSingle);
  allComponentsBipartie = 1;
  for (long long i = 0; i < n; i++)
    if (!vis[i]) {
      dfs(i);
      cntComponents++;
    }
  if (allComponentsBipartie) ans[5] = (1ll << cntComponents);
  long long half = (n + 1) / 2;
  for (long long i = 0; i < (1 << half); i++) {
    if (__builtin_popcountll(i) < 2)
      good[i] = 1;
    else if (__builtin_popcountll(i) == 2) {
      vector<long long> v;
      for (long long j = 0; j < half; j++)
        if (i & (1 << j)) v.push_back(j);
      if (!con[v[0]][v[1]]) good[i] = 1;
    } else {
      good[i] = 1;
      for (long long j = 0; j < half; j++)
        if (i & (1 << j)) good[i] &= good[i ^ (1 << j)];
    }
  }
  for (long long i = 0; i < (1 << (n - half)); i++) {
    if (__builtin_popcountll(i) < 2)
      dp[i] = 1;
    else if (__builtin_popcountll(i) == 2) {
      vector<long long> v;
      for (long long j = 0; j < n - half; j++)
        if (i & (1 << j)) v.push_back(j + half);
      if (!con[v[0]][v[1]]) dp[i] = 1;
    } else {
      dp[i] = 1;
      for (long long j = 0; j < n - half; j++)
        if (i & (1 << j)) dp[i] &= dp[i ^ (1 << j)];
    }
  }
  for (long long i = 0; i < n - half; i++)
    for (long long j = 0; j < (1 << (n - half)); j++)
      if (j & (1 << i)) dp[j] += dp[j ^ (1 << i)];
  for (long long i = 0; i < (1 << half); i++)
    if (good[i]) {
      long long mask = (1 << (n - half)) - 1;
      for (long long j = 0; j < half; j++)
        if (i & (1 << j)) {
          for (auto k : g[j])
            if (k >= half) {
              if (mask & (1 << (k - half))) mask ^= (1 << (k - half));
            }
        }
      ans[1] += dp[mask];
      ans[4] += dp[mask];
    }
  ans[2] = (1ll << cntComponents);
  ans[0] = (1ll << n);
  long long finalAns = 0;
  for (long long i = 0; i < 8; i++) {
    if (__builtin_popcountll(i) & 1)
      finalAns -= ans[i];
    else
      finalAns += ans[i];
  }
  cout << finalAns;
  return 0;
}
