#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;
};

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;
    }
}

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

int sg  = 0;
int ans = 0;

int get_sg(int sz) {
    if (sz == 0) return 0;
    else if (sz & 1) return 1;
    else return 2;
}

void dian(int fa, int now) {
    int nsg = sg;
    for (int i = head[now]; i; i = edge[i].next) {
        const int to = edge[i].to;
        if (to == fa) continue;
        nsg ^= get_sg(nodes[to].sz);
    }
    if ((nsg ^ get_sg(nodes[fa].sz - nodes[now].sz)) == 0) {
        ans++;
    }
}

void bian(int fa, int now) {
    if ((sg ^ get_sg(nodes[fa].sz - nodes[now].sz) ^ get_sg(nodes[now].sz)) == 0) {
        ans++;
    }
}

void dfs2(int fa, int now) {
    dian(fa, now);
    if (fa != now) bian(fa, now);
    for (int i = head[now]; i; i = edge[i].next) {
        const int to = edge[i].to;
        if (to == fa) continue;
        dfs2(now, to);
    }
}

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);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (nodes[i].tree == i) {
            sg ^= get_sg(nodes[i].sz);
        }
    }

    for (int i = 1; i <= n; i++) {
        if (nodes[i].tree == i) {
            sg ^= get_sg(nodes[i].sz);
            dfs2(i, i);
            sg ^= get_sg(nodes[i].sz);
        }
    }

    cout << ans;
}