#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define Mirai ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
using namespace std;
typedef pair<int,int> pii;
const int N=1e5+10;
void solve()
{
    int n,m;cin>>n>>m;
    vector<vector<int>> g(n+1);
    vector<int> p(n+1);
    iota(p.begin(),p.end(),0);

    auto find=[&](auto &&self,int x)->int{
        if(p[x]!=x)return p[x]=self(self,p[x]);
        return p[x];
    };

    for(int i=1;i<=m;i++)
    {
        int u,v;cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
        int pu=find(find,u),pv=find(find,v);
        if(pu!=pv)
        {
            p[pu]=pv;
        }
    }
    vector<int> sz(n+1);
    vector<int> Xor(n+1);//子树SG值异或和
    vector<int> sg(n+1);
    auto dfs=[&](auto &&self,int u,int father)->void{
        sz[u]=1;
        for(auto v:g[u])
        {
            if(v==father)continue;
            self(self,v,u);
            sz[u]+=sz[v];
            if(sz[v]&1)Xor[u]^=1;
            else Xor[u]^=2;
        }
    };

    int sum=0;
    for(int i=1;i<=n;i++)
    {
        if(p[i]==i)
        {
            dfs(dfs,i,-1);
            // cout<<i<<" "<<sz[i]<<endl;
            if(sz[i]&1)sum^=1;
            else sum^=2;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(sz[i]&1)sg[i]=1;
        else sg[i]=2;
    }
    // cout<<Xor<<endl;

    int res=0;
    auto dfs2=[&](auto &&self,int u,int father,int other)->void{
        int fasz=sz[find(find,u)]-sz[u];
        if(fasz&1)fasz=1;
        else fasz=2;
        if((fasz^Xor[u]^other)==0)
        {
            res++;
            // cout<<u<<" ";
            // cout<<fasz<<" "<<Xor[u]<<" "<<other<<endl;
        }
        fasz=3-fasz;//带上自己 
        for(auto v:g[u])
        {
            if(v==father)continue;
            self(self,v,u,other);
            if((other^fasz^sg[v])==0)
            {
                res++;
                // cout<<u<<" "<<v<<" ";
                // cout<<other<<" "<<fasz<<" "<<sg[v]<<endl;
            }
        }
    };

    for(int i=1;i<=n;i++)
    {
        if(p[i]==i)
        {
            dfs2(dfs2,i,-1,sum^sg[i]);
        }
    }
    cout<<res<<endl;
}
signed main()
{
    Mirai;
    int T=1;
    // cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}