#include <bits/stdc++.h>
#define ll long long
#define M 998244353
using namespace std;

ll ans,n,m,x,y,color[210000];
vector<ll>G[210000];

bool dfs(int u, int c) {
	color[u] = c;
	for (ll i=1;i<=G[u][0];i++) {
		ll v=G[u][i];
		if (color[v] == c) return false;
		else if (color[v] == -1) {
			if (!dfs(v, c ^ 1)) return false;
		}
	}
	return true;
}

ll f(ll x,ll p){
	ll ans=1;
	while(p){
		if(p&1){
			ans=(ans*x)%M;
		}
		p>>=1;
		x=(x*x)%M;
	}
	return ans;
}

int main() {
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		G[i].push_back(0);
		color[i]=-1;
	}
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		G[x].push_back(y);
		G[x][0]++;
		G[y].push_back(x);
		G[y][0]++;
	}
	for (int u = 1; u <= n; ++u) {
		if (color[u] != -1){
			continue;
		}
		ans=(ans+1)%M;
		if (!dfs(u, 0)){
			cout<<0;
			return 0;
		}
	}
	cout<<f(2,ans);
	return 0;
}