#include <bits/stdc++.h>
using namespace std;
using LL = long long;



int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> e(n);
    for (int i = 0; i < m; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        e[u].push_back(v);
        e[v].push_back(u);
    }

    vector<bool> vis(n);
    vector<int> siz(n);
    auto dfs = [&](auto &&self, int u) -> void {
        vis[u] = true;
        siz[u] = 1;
        for (int v : e[u]) {
            if (vis[v]) {
                continue;
            }
            self(self, v);
            siz[u] += siz[v];
        }
    };

    auto get = [&](const int &x) {
        return (x % 2) ? 1 : 2;
    };

    int res = 0;
    for (int i = 0; i < n; ++i) {
        if (!vis[i]) {
            dfs(dfs, i);
            res ^= get(siz[i]);
        }
    }

    int ans = 0;
    int tot = 0;
    auto dfs1 = [&](auto &&self, int u) -> void {
        vis[u] = true;
        int t1 = 0;
        for (int v : e[u]) {
            if (vis[v]) {
                continue;
            }
            if ((res ^ get(siz[v]) ^ get(n - siz[v])) == 0) {
                ans++;
            }
            self(self, v);
            t1 ^= get(siz[v]);
        }

        if (tot - siz[u] > 0) {
            t1 ^= get(tot - siz[u]);
        }
        if ((t1 ^ res) == 0) {
            ans++;
        }
    };

    vis.assign(n, false);
    for (int i = 0; i < n; ++i) {
        if (!vis[i]) {
            res ^= get(siz[i]);
            tot = siz[i];
            dfs1(dfs1, i);
            res ^= get(siz[i]);
        }
    }

    cout << ans << '\n';
    return 0;
}