#include <bits/stdc++.h>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<int>> adj(n);
    std::vector<std::pair<int, int>> edge(m);
    for (int i = 0; i < m; i++) {
        int u, v;
        std::cin >> u >> v;
        u--, v--;

        adj[u].emplace_back(v);
        adj[v].emplace_back(u);
        edge[i] = {u, v};
    }

    std::vector<int> sz(n), sg(n), f(n, -1), dep(n);
    auto dfs = [&](auto dfs, int x, int fa, int rt) -> void {
        f[x] = rt;
        sz[x] = 1;
        for (auto y : adj[x]) {
            if (y == fa)
                continue;
            dep[y] = dep[x] + 1;
            dfs(dfs, y, x, rt);
            sz[x] += sz[y];
        }
        sg[x] = (sz[x] & 1) ? 1 : 2;
    };

    int tot = 0;
    for (int i = 0; i < n; i++) {
        if (f[i] == -1) {
            dfs(dfs, i, -1, i);
            tot ^= sg[i];
        }
    }

    int ans = 0;
    for (int i = 0; i < n; i++) {
        int tmp = tot;
        for (auto j : adj[i]) {
            if (j == f[i])
                continue;
            tmp ^= sg[j];
        }
        tmp ^= sg[f[i]];
        if (f[i] != i)
            tmp ^= ((sz[f[i]] - sz[i]) & 1) ? 1 : 2;
        if (!tmp)
            ans++;
    }

    for (auto [u, v] : edge) {
        if (dep[v] < dep[u])
            std::swap(u, v);

        int tmp = tot;
        tmp ^= sg[f[v]] ^ sg[v] ^ (((sz[f[v]] - sz[v]) & 1) ? 1 : 2);
        // std::cerr << tot << " " << f[v] << " " << v << " " << sz[f[v]] << " " << sz[v] << "\n";
        // std::cerr << sg[f[v]] << " " << sg[v] << " " << (((sz[f[v]] - sz[v]) & 1) ? 1 : 2) << "\n";
        if (!tmp)
            ans++;
    }

    std::cout << ans << "\n";

    return 0;
}