#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5;
vector<int> e[N];
bool vis[N];
int fe[N],sum[N],du[N],sdu[N];
int ans;
int df(int u,int cnt){
    vis[u]=1;
    int res=1;
    if(du[u]%2==1)sdu[cnt]++;
    for(auto v:e[u]){
        if(vis[v]) continue;
        res+=df(v,cnt);
    }
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n,m;cin>>n>>m;
    for(int i=1;i<=m;i++){
        int u,v;cin>>u>>v;
        e[u].push_back(v);
        e[v].push_back(u);
        du[u]++;du[v]++;
    }
    int cnt=0;
    for(int i=1;i<=n;i++){
        if(vis[i]) continue;
        fe[++cnt]=i;
        sum[cnt]=df(i,cnt);
        //cout<<"sum["<<cnt<<"]="<<sum[cnt]<<endl;
    }
    int sg=0;
    for(int i=1;i<=cnt;i++){
        sg^=(sum[i]%2==0?2:1);
    }
    for(int i=1;i<=n;i++)vis[i]=0;
    for(int i=1;i<=cnt;i++){
        int s=sg^(sum[i]%2==0?2:1);

        if(sum[i]==1&&s==0)ans++;
        else if(sum[i]%2==0&&s==1)ans+=sdu[i];
        else if(sum[i]%2==0&&s==3)ans+=sum[i]-sdu[i];
        else if(sum[i]>1&&sum[i]%2==1&&s==0)ans+=sdu[i];
        else if(sum[i]>1&&sum[i]%2==1&&s==2)ans+=sum[i]-sdu[i];
        if(sum[i]%2==1&&s==3)ans+=sum[i]-1;
        else if(sum[i]%2==0&&s==0)ans+=sum[i]-1;
    }
    cout<<ans<<endl;
    return 0;
}