#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int fa[N],n,m,vis[N],siz[N],sz[N];
int fir[N],ne[N<<1],to[N<<1],cnt;
int sum,ans;
void add(int x,int y) {
	ne[++cnt]=fir[x];
	fir[x]=cnt;
	to[cnt]=y;
}
int gts(int x) {
	if(fa[x]!=x) fa[x]=gts(fa[x]);
	return fa[x];
}
void dfs(int x,int ff) {
	sz[x]=1;vis[x]=1;
	int nans=ans; nans^=siz[gts(x)]&1?1:2;
	for(int i=fir[x];i;i=ne[i]) {
		int y=to[i];
		if(y==ff) continue;
		dfs(y,x); sz[x]+=sz[y];
		int nw=ans^(sz[y]&1?1:2)^((siz[gts(x)]-sz[y])&1?1:2)^(siz[gts(x)]&1?1:2);
		if(nw==0) sum++;
		nans^=sz[y]&1?1:2;
	}
//	cout<<"!   "<<x<<" "<<sum<<" "<<"? "<<siz[gts(x)]<<" "<<sz[x]<<" "<<nans<<"  ";
	nans^=(siz[gts(x)]-sz[x])&1?1:2;
	if(nans==0) sum++;
//	cout<<sum<<"\n";
}
int main() {
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) fa[i]=i,siz[i]=1;
	for(int i=1;i<=m;i++) {
		int x,y;scanf("%d%d",&x,&y);
		add(x,y);add(y,x);
		siz[gts(x)]+=siz[gts(y)];
		fa[gts(y)]=gts(x); 
	}
	for(int i=1;i<=n;i++) {
		if(fa[i]!=i) continue;
		ans^=siz[i]&1?1:2;
//		cout<<siz[i]<<"\n";
	}
	
	if(ans==0) {
		cout<<"0\n";
		return 0;
	}
	for(int i=1;i<=n;i++) {
		if(!vis[i]) dfs(i,0);
	}
	cout<<sum;
	return 0;
}