//1024i
#include <iostream>
#include <vector>
#include <cstring>

using namespace std;

const int MAXN = 2e5 + 5;
const int MOD = 998244353;

vector<int> graph[MAXN];
int color[MAXN];
int n, m;

bool dfs(int u, int c) {
    color[u] = c;
    for (int v : graph[u]) {
        if (color[v] == c) return false;
        if (color[v] == 0 && !dfs(v, 3-c)) return false;
    }
    return true;
}

bool is_bipartite() {
    memset(color, 0, sizeof(color));
    for (int i = 1; i <= n; i++) {
        if (color[i] == 0 && !dfs(i, 1)) {
            return false;
        }
    }
    return true;
}

int count_components() {
    int count = 0;
    memset(color, 0, sizeof(color));
    for (int i = 1; i <= n; i++) {
        if (color[i] == 0) {
            dfs(i, 1);
            count++;
        }
    }
    return count;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    
    if (!is_bipartite()) {
        cout << 0 << endl;
    } else {
        int components = count_components();
        int result = 1;
        for (int i = 0; i < components; i++) {
            result = (result * 2) % MOD;
        }
        cout << result << endl;
    }
    
    return 0;
}
//1024i