#include <bits/stdc++.h>
#define int long long

using namespace std;

int n, m;
vector<int> adj[51];
int visited[51];

int BFS(int s) {
    int cnt = 1;
    queue<int> q;

    q.push(s);
    visited[s] = true;

    while (!q.empty()) {
        int u = q.front();
        q.pop();

        for (int v : adj[u]) {
            if (!visited[v]) {
                cnt += 1;
                q.push(v);
                visited[v] = true;
            }
        }
    }

    return cnt;
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;

    int res = 1;

    for (int i = 1, x, y; i <= m; i += 1) {
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    for (int i = 1; i <= n; i += 1) {
        if (!visited[i]) {
            int Size = BFS(i);
            for (int k = 1; k < Size; k += 1) {
                res *= 2;
            }
        }
    }

    cout << res;

    return 0;
}