#include <bits/stdc++.h>
#define rep(i, a, b) for (auto cc##i = (b), i = (a); i <= cc##i; ++i)
#define per(i, a, b) for (auto cc##i = (b), i = (a); i >= cc##i; --i)
#define fi first
#define se second
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
const int N = 1e5 + 5;

int n, m, res, sum, ans, siz[N], vis[N];
vector<int> G[N];
inline int w(int s) {
    return (s & 1) ? 1 : 2;
}
void dfs1(int u, int fa) {
    vis[u] = 1, siz[u] = 1;
    for (auto v : G[u]) if (v != fa) {
        dfs1(v, u);
        siz[u] += siz[v];
    }
}
void dfs2(int u, int fa) {
    vis[u] = 1, siz[u] = 1;
    int var = res;
    for (auto v : G[u]) if (v != fa) {
        dfs2(v, u);
        siz[u] += siz[v];
        var ^= w(siz[v]);
    }
    if (fa) {
        if (!(res ^ w(siz[u]) ^ w(sum - siz[u]))) ++ans;
        var ^= w(sum - siz[u]);
    }
    if (!var) {
        ++ans;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    rep(i, 1, m) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int res = 0;
    rep(i, 1, n) {
        if (!vis[i]) {
            dfs1(i, 0);
            res ^= w(siz[i]);
        }
    }
    memset(vis, 0, sizeof vis);
    rep(i, 1, n) {
        if (!vis[i]) {
            sum = siz[i];
            res ^= w(siz[i]);
            dfs2(i, 0);
            res ^= w(siz[i]);
        }
    }
    cout << ans << "\n";
    return 0;
}