#include <bits/stdc++.h>

using namespace std;
typedef unsigned long long ull;

mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2.5e5 + 10;
int n, m; vector<int> G[N];

ull w[N], goal; int dep[N];
map<ull, int> Map;
void dfs(int u, int fa) {
    dep[u] = dep[fa] + 1;
    for(auto v : G[u]) {
        if(!dep[v]) dfs(v, u);
        else if(v != fa && dep[v] < dep[u]) {
            ull val = Rand();
            Map[val] ++, w[v] ^= val, w[u] ^= val;
            if((dep[u] - dep[v] + 1) & 1) goal ^= val;
        }
    }
    for(auto v : G[u])
        if(dep[v] == dep[u] + 1) w[u] ^= w[v];
    if(fa) Map[w[u]] ++;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);

    cin >> n >> m;
    for(int i = 1; i <= m; i ++) {
        int a, b; cin >> a >> b;
        G[a].emplace_back(b), G[b].emplace_back(a);
    }
    dfs(1, 0);
    if(!goal) {
        cout << "1" << '\n';
        return 0;
    }
    long long ans = 0;
    for(auto pr : Map) {
        ull x = pr.first, y = goal ^ pr.first;
        if(y == 0) {cout << pr.second << '\n'; return 0; }
        if(y < x && Map.count(y)) ans += 1ll * Map[x] * Map[y];
    }
    cout << ans << '\n';

    return 0;
}