#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e5 + 5;

struct edge {
	int to, Next;

	edge() {}
	edge(int to, int Next): to(to), Next(Next) {}
} G[N << 1];

int head[N], cnt;

inline void add_edge(int u, int v) {
	G[++cnt] = edge(v, head[u]);
	head[u] = cnt;
}

int n, m, ans, cnt1, cnt2, fa[N], siz[N];

inline int _find(int u) {
	return (fa[u] == u) ? u : (fa[u] = _find(fa[u]));
}

inline void merge(int u, int v) {
	u = _find(u), v = _find(v);
	if (u == v) {
		return;
	}
	fa[u] = v;
	siz[v] += siz[u];
}

int sp, S[N];

inline void init(int fa, int u) {
	S[u] = 1;
	for (int i = head[u]; i; i = G[i].Next) {
		int v = G[i].to;
		if (v == fa) {
			continue;
		}
		init(u, v);
		S[u] += S[v];
	}
}

inline void dfs(int fa, int u) {
	int t1 = cnt1, t2 = cnt2;
	for (int i = head[u]; i; i = G[i].Next) {
		int v = G[i].to;
		if (v == fa) {
			continue;
		}
		if (S[v] & 1) {
			t1 ^= 1;
		} else {
			t2 ^= 1;
		}
	}
	if ((sp - S[u]) & 1) {
		t1 ^= 1;
	} else {
		t2 ^= 1;
	}
	if (!t1 && !t2) {
		++ans;
	}
	for (int i = head[u]; i; i = G[i].Next) {
		int v = G[i].to;
		if (v == fa) {
			continue;
		}
		dfs(u, v);
		t1 = cnt1, t2 = cnt2;
		if (S[v] & 1) {
			t1 ^= 1;
		} else {
			t2 ^= 1;
		}
		if ((sp - S[v]) & 1) {
			t1 ^= 1;
		} else {
			t2 ^= 1;
		}
		if (!t1 && !t2) {
			++ans;
		}
	}
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		fa[i] = i;
		siz[i] = 1;
	}
	while (m--) {
		int u, v;
		cin >> u >> v;
		merge(u, v);
		add_edge(u, v);
		add_edge(v, u);
	}
	for (int i = 1; i <= n; ++i) {
		if (_find(i) != i) {
			continue;
		}
		if (siz[i] & 1) {
			cnt1 ^= 1;
		} else {
			cnt2 ^= 1;
		}
	}
	if (!cnt1 && !cnt2) {
		cout << "0\n";
		return 0;
	}
	for (int i = 1; i <= n; ++i) {
		if (_find(i) == i) {
			init(0, i);
		}
	}
	for (int i = 1; i <= n; ++i) {
		if (_find(i) == i) {
			sp = siz[i];
			if (sp & 1) {
				cnt1 ^= 1;
			} else {
				cnt2 ^= 1;
			}
			dfs(0, i);
			if (sp & 1) {
				cnt1 ^= 1;
			} else {
				cnt2 ^= 1;
			}
		}
	}
	cout << ans << "\n";
	return 0;
}