#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve () {
    int n, m;
    cin >> n >> m;

    vector <vector <int>> e (n);
    for (int i = 0; i < m; i ++) {
        int x, y;
        cin >> x >> y;
        x --; y --;
        e[x].push_back (y);
        e[y].push_back (x);
    }

    int sum = 0;
    int cnt1 = 0, cnt2 = 0;
    int ans = 0;

    vector <int> sz (n, 1);
    vector <int> ok (n);
    
    auto dfs1 = [&] (auto &&self, int x, int fa) -> void {
        ok[x] = 1;
        for (auto y : e[x]) {
            if (y == fa) {
                continue;
            }
            self (self, y, x);
            sz[x] += sz[y];
        }
    };
    for (int i = 0; i < n; i ++) {
        if (! ok[i]) {
            dfs1 (dfs1, i, -1);
            sum ++;
            if (sz[i] & 1) {
                cnt1 ++;
            } else {
                cnt2 ++;
            }
        }
    }

    auto dfs2 = [&] (auto &&self, int x, int fa, int tot) -> void {
        ok[x] = 2;
        int c1 = cnt1, c2 = cnt2;
        if (tot - sz[x] & 1) {
            c1 ++;
        } else {
            c2 ++;
        }
        for (auto y : e[x]) {
            if (y == fa) {
                continue;
            }
            if (sz[y] & 1) {
                c1 ++;
            } else {
                c2 ++;
            }
        }
        int now = 0;
        if (c1 & 1) {
            now ^= 1;
        }
        if (c2 & 1) {
            now ^= 2;
        }
        if (!now) {
            ans ++;
        }
        // cerr << x << " " << ans << '\n';
        for (int y : e[x]) {
            if (y == fa) {
                continue;
            }
            c1 = cnt1;
            c2 = cnt2;
            if (sz[y] & 1) {
                c1 ++;
            } else {
                c2 ++;
            }
            if (tot - sz[y] & 1) {
                c1 ++;
            } else {
                c2 ++;
            }
            int now = 0;
            if (c1 & 1) {
                now ^= 1;
            }
            if (c2 & 1) {
                now ^= 2;
            }
            if (!now) {
                ans ++;
            }
            self (self, y, x, tot);
        }
    };
    for (int i = 0; i < n; i ++) {
        if (ok[i] == 1) {
            if (sz[i] & 1) {
                cnt1 --;
            } else {
                cnt2 --;
            }
            dfs2 (dfs2, i, -1, sz[i]);
            if (sz[i] & 1) {
                cnt1 ++;
            } else {
                cnt2 ++;
            }
        }
    }

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

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

    int T = 1;
    // cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}