#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve();
signed main(){
    cin.sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
    return 0;
}
#define N 1000100
vector<int> g[N];
int vis[N], ns[N], es[N], fa[N], d[N];
pair<int,int> dfs(int u, int ff){
    vis[u] = 1;
    fa[u] = ff;
    pair<int,int> res = {1, g[u].size()};
    for(int v:g[u]){
        if(vis[v] == 0){
            auto [x,y] = dfs(v, ff);
            res.first += x;
            res.second += y;
        }
    }
    return res;
}
void solve(){
    int n, m;
    cin >> n >> m;
    //vector<pair<int,int>> edgs(m + 1);
    for(int i = 0;i < m;i++){
        int u, v;
        cin >> u >> v;
        //edgs[i + 1] = {u, v};
        g[u].push_back(v);
        g[v].push_back(u);
        d[v]++;
        d[u]++;
    }
    int cnt = 0, cnt1 = 0;;
    for(int i = 1;i <= n;i++){
        if(d[i] % 2 == 0)cnt++;
        if(d[i] % 2 == 1)cnt1++;
    }
    if((n + m) % 2){
        cout << m << "\n";
    }
    else{
        cout << cnt1 << "\n";
        //cout << m + cnt << "\n";
    }
}