#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int maxN = 100005;

vector <int> G[maxN];
bool used[maxN];

int dfs(int nod) {
    used[nod] = 1;
    int sz = 1;
    for (int vecin : G[nod]) {
        if (!used[vecin]) {
            sz += dfs(vecin);
        }
    }
    return sz;
}

void solve() {
    int n, m, ans = 0;
    cin >> n >> m;
    int nr = n - m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (int i = 1; i <= n; i++) {
        if (used[i]) {
            continue;
        }
        int sz = dfs(i);
        if (nr % 2 == 1) {
            if (sz % 2 == 0) {
                ans += sz - 1;
            }
            else {
                ans += sz;
            }
        }
        else {
            if (sz % 2 == 1) {
                ans += sz - 1;
            }
            else {
                ans += sz;
            }
        }
    }
    cout << ans;
}

int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    int nrTeste = 1;
    //cin >> nrTeste;
    while (nrTeste--) {
        solve();
    }
    return 0;
}