#include<bits/stdc++.h>
using namespace std;
#define il inline
#define fi first
#define se second
#define mk make_pair
#define eb emplace_back
#define rep(i,l,r) for(int i=(l); i<=(r); ++i)
#define rep_(i,l,r) for(int i=(l); i>=(r); --i)
typedef long long lr;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
constexpr int mod1=998244353,mod2=1e9+7;
constexpr db pi=3.141592653589793,eps=1e-9;
constexpr int inf32=0x3f3f3f3f,Inf32=0xc0c0c0c0;
constexpr lr inf64=0x3f3f3f3f3f3f3f3f,Inf64=0xc0c0c0c0c0c0c0c0;
template<typename T>il T Max(T x,T y) { return (x>y)? x:y; }
template<typename T>il T Min(T x,T y) { return (x<y)? x:y; }
template<typename T>il T gcd(T x,T y) { return (!y)? x:gcd(y,x%y); }
template<typename T>il T Abs(T x) { return (x>0)? x:(-x); }
template<typename T>il T Rnd(T l,T r,mt19937_64 &eng)
{
	uniform_int_distribution<T> uid(l,r);
	return uid(eng);
}
mt19937_64 eng(chrono::high_resolution_clock::now().time_since_epoch().count());
constexpr int N=100100;
int n,m,x[N],y[N],siz[N],fa[N],sz[N],val1[N],val2[N]; vi v[N],w[N];
bool vis[N];
il int calc(int _) { return (_&1)? 1:2; }
il int Find(int _) { return (fa[_]==_)? _:fa[_]=Find(fa[_]); }
il void Merge(int X,int Y) { (sz[X]<sz[Y])? (fa[X]=Y,sz[Y]+=sz[X]):(fa[Y]=X,sz[X]+=sz[Y]); }
il void dfs(int u,int fa)
{
	vis[u]=1,siz[u]=1;
	for(int to:v[u])
		if(y[to]!=fa)
			dfs(y[to],u),siz[u]+=siz[y[to]];
	for(int to:w[u])
		if(x[to]!=fa)
			dfs(x[to],u),siz[u]+=siz[x[to]];
}
il void dfs2(int u,int fa,int rt)
{
	val1[u]=calc(siz[rt])^calc(siz[rt]-siz[u]);
	for(int to:v[u])
		if(y[to]!=fa)
			val1[u]^=calc(siz[y[to]]),val2[to]=calc(siz[rt])^calc(siz[rt]-siz[y[to]])^calc(siz[y[to]]),dfs2(y[to],u,rt);
	for(int to:w[u])
		if(x[to]!=fa)
			val1[u]^=calc(siz[x[to]]),val2[to]=calc(siz[rt])^calc(siz[rt]-siz[x[to]])^calc(siz[x[to]]),dfs2(x[to],u,rt);
}
il void Solve()
{
	cin>>n>>m;
	rep(i,1,n)
		fa[i]=i,sz[i]=1;
	rep(i,1,m)
	{
		cin>>x[i]>>y[i],Merge(Find(x[i]),Find(y[i]));
		v[x[i]].eb(i),w[y[i]].eb(i);
	}
	rep(i,1,n)
		if(!vis[i])
			dfs(i,0),dfs2(i,0,i);
	int bp=0;
	rep(i,1,n)
		if(Find(i)==i)
			bp^=calc(sz[i]);
	int ans=0;
	rep(i,1,n)
		if(!(bp^val1[i]))
			++ans;
	rep(i,1,m)
		if(!(bp^val2[i]))
			++ans;
	cout<<ans<<'\n';
}
int main()
{
#ifdef LOCAL
	string fpre="test",isuf="in",osuf="out";
	assert(freopen((fpre+"."+isuf).c_str(),"r",stdin));
	assert(freopen((fpre+"."+osuf).c_str(),"w",stdout));
#endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	while(T--)
		Solve();
	return 0;
}