#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int N = 1e5 + 10;

//////////////////////////////////////

struct {
    int to, next;
} edge[N << 1];;

int head[N];
int cnt;

void add(const int u, const int v) {
    edge[++cnt] = {v, head[u]};
    head[u]     = cnt;
}

//////////////////////////////////////

struct node {
    int fa, tree, sz = 1;
    int sg           = 0;
    int tot_sg;
};

node nodes[N];

void dfs(const int tree, const int fa, const int now) {
    nodes[now].fa   = fa;
    nodes[now].tree = tree;
    for (int i = head[now]; i; i = edge[i].next) {
        const int to = edge[i].to;
        if (to == fa) continue;
        dfs(tree, now, to);
        nodes[now].sz += nodes[to].sz;
    }
}

void dfs2(const int fa, const int now) {
    nodes[now].sg     = ((nodes[now].sz & 1) ? 1 : 2);
    nodes[now].tot_sg = nodes[now].sg;
    for (int i = head[now]; i; i = edge[i].next) {
        const int to = edge[i].to;
        if (to == fa) continue;
        dfs2(now, to);
        nodes[now].tot_sg ^= nodes[to].tot_sg;
    }
}

//////////////////////////////////////

int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        add(u, v);
        add(v, u);
    }
    for (int i = 1; i <= n; i++) {
        if (nodes[i].tree == 0) {
            dfs(i, i, i);
            dfs2(i, i);
        }
    }

    int sg = 0;
    for (int i = 1; i <= n; i++) {
        if (nodes[i].tree == i) {
            sg ^= nodes[i].tot_sg;
        }
    }

    int ans                            = 0;
    std::function<void(int, int)> dfs3 = [&](const int fa, const int now) {
        const auto sz = nodes[nodes[now].tree].sz - nodes[now].sz;
        int nsg       = 0;
        if (sz > 0) {
            if (sz & 1) nsg = 1;
            else nsg        = 2;
        }

        // 边
        if (now != fa) {
            if ((sg ^ nsg ^ nodes[now].sg) == 0) {
                ans++;
            }
        }

        // 点
        for (int j = head[now]; j; j = edge[j].next) {
            int to = edge[j].to;
            if (to == fa) continue;
            nsg ^= nodes[to].sg;
            dfs3(now, to);
        }
        if ((sg ^ nsg) == 0) {
            ans++;
        }
    };

    for (int i = 1; i <= n; i++) {
        if (nodes[i].tree == i) {
            sg ^= nodes[i].tot_sg;
            dfs3(i, i);
            sg ^= nodes[i].tot_sg;
        }
    }
    cout << ans;
}