#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<cstring>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<algorithm>

#include<stack>

#include<queue>

using namespace std;

#define INF 1000000000

#define eps 1e-8

#define pii pair<int,int>

#define LL long long int

int n,m,maps[][],a,b;

int mark[],num;

void dfs(int x)

{

    mark[x]=;

    for(int i=;i<=n;i++)

    {

        if(mark[i]==&&maps[x][i])

        {

            dfs(i);

        }

    }

}

int main()

{

    //freopen("in1.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    scanf("%d%d",&n,&m);

    for(int i=;i<=m;i++)

    {

        scanf("%d%d",&a,&b);

        maps[a][b]=maps[b][a]=;

    }

    for(int i=;i<=n;i++)

    {

        if(!mark[i])

        {

            num++;

            dfs(i);

        }

    }

    printf("%I64d\n",(LL)<<(n-num));

    //fclose(stdin);

    //fclose(stdout);

    return ;

}