#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 using namespace std;

 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)

 typedef long long LL;

 const int INF = (<<)-;

 const int mod=;

 const int maxn=;

 int p[maxn];

 vector<int> g[maxn];

 int find(int x){ return x==p[x]? x:p[x]=find(p[x]);}

 LL pow_my(int x){

     LL ans=;

     for(int i=;i<=x;i++) ans=(LL)ans*;

     return ans;

 }

 int main(){

     int n,m;

     cin>>n>>m;

     for(int i=;i<=n;i++) p[i]=i;

     while(m--){

         int u,v;

         cin>>u>>v;

         int x=find(u);

         int y=find(v);

         if(x!=y) p[x]=y;

     }

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

         int x=find(i);

         g[x].push_back(i);

     }

     int ans=;

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

         if(g[i].size()!=) ans+=g[i].size()-;

     }

     cout<<pow_my(ans)<<"\n";

     return ;

 }