#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200000 + 10;
const int mod = 998244353; 
int n,m;
int co[N],ans = 1;
vector <int> G[N]; 
int read(){
	char ch; int sum = 0,flag = 1;
	ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') flag = -flag; ch = getchar();}
	while(ch >= '0' && ch <= '9'){sum = sum * 10 + ch - '0'; ch = getchar();}
	return flag * sum;
}
bool dfs(int x){
	for(int i = 0; i < G[x].size(); i++){
		int y = G[x][i];
		if(co[y] == co[x]) return false;
		if(co[y] > 0) continue;
		if(co[x] == 1) co[y] = 2;
		else co[y] = 1;
		if(!dfs(y)) return false;
	}
	return true;
}
signed main(){
	n = read(); m = read();
	for(int i = 1; i <= m; i++){
		int x,y;
		x = read(); y = read();
		G[x].push_back(y);
		G[y].push_back(x);
	}
	for(int i = 1; i <= n; i++){
		if(co[i]) continue;
		co[i] = 1; 
	    int res = dfs(i);
	    if(res) ans = (ans * 2) % mod;
	    else ans = 0;
	}
	printf("%lld\n",ans % mod);
	return 0;
}