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

#ifndef ONLINE_JUDGE
#include "debug.cpp"
#else
#define debug(...)
#endif

#define int long long

main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int N, M; cin >> N >> M;
  vector<vector<int>> g(N);
  vector<pair<int, int>> edges(M);
  for (int i = 0; i < M; ++i) {
    int u, v; cin >> u >> v; --u, --v;
    edges[i] = {u, v};
    g[u].push_back(v);
    g[v].push_back(u);
  }

  vector<int> parent(N), sub(N), root(N);
  auto dfs = [&](auto self, int x, int p = -1) -> void {
    sub[x] = 1;
    parent[x] = p;
    root[x] = p == -1 ? x : root[p];
    for (int to : g[x]) {
      if (to != p) {
        self(self, to, x);
        sub[x] += sub[to];
      }
    }
  };

  dfs(dfs, 0, -1);

  vector<int> parity(2);
  for (int i = 0; i < N; ++i) {
    if (parent[i] == -1) {
      parity[sub[i] & 1] ^= 1;
    }
  }

  int total = 0;

  for (int i = 0; i < N; ++i) { // let's remove node i
    int tree_size = sub[root[i]];
    
    auto save = parity;
    parity[tree_size & 1] ^= 1;
    for (int to : g[i]) {
      int s = to == parent[i] ? tree_size - sub[i] : sub[to];
      parity[s & 1] ^= 1;
    }

    if (parity[0] == 0 && parity[1] == 0) {
      ++total;
    }

    parity = save;
  }

  for (pair<int, int> e : edges) { // let's remove this edge
    if (parent[e.first] == e.second) {
      swap(e.first, e.second);
    }

    int tree_size = sub[root[e.first]];
    auto save = parity;
    parity[tree_size & 1] ^= 1;

    int sub_first = tree_size - sub[e.second];
    int sub_second = sub[e.second];
    parity[sub_first & 1] ^= 1;
    parity[sub_second & 1] ^= 1;

    if (parity[0] == 0 && parity[1] == 0) {
      ++total;
    }

    parity = save;
  }

  cout << total << endl;
}