// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n, m;
vi adj[MAXN];
int cnt[2];
int ans;

int p[MAXN];
int vis[MAXN];
int sub[MAXN];
void dfs(int u) {
    sub[u] = 1;
    for (int v : adj[u]) {
        if (vis[v]) {
            continue;
        }
        vis[v] = vis[u];
        p[v] = u;
        dfs(v);
        sub[u] ^= sub[v];
    }
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n >> m;
    REP (i, 0, m) {
        int u, v; cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    REP (i, 1, n + 1) {
        if (vis[i]) {
            continue;
        }
        vis[i] = i;
        dfs(i);
        cnt[sub[i]] ^= 1;
    }
    REP (u, 1, n + 1) {
        for (int v : adj[u]) {
            if (v == p[u]) {
                continue;
            }
            int tcnt[2] = {0, 0};
            tcnt[sub[vis[v]]] ^= 1;
            tcnt[sub[v]] ^= 1;
            tcnt[sub[vis[v]] ^ sub[v]] ^= 1;
            if (tcnt[0] == cnt[0] && tcnt[1] == cnt[1]) {
                ans++;
            }
        }
        int tcnt[2] = {0, 0};
        tcnt[sub[vis[u]]] ^= 1;
        int tot = sub[vis[u]] ^ 1;
        for (int v : adj[u]) {
            if (v == p[u]) {
                continue;
            }
            tot ^= sub[v];
            tcnt[sub[v]] ^= 1;
        }
        tcnt[tot] ^= 1;
        if (tcnt[0] == cnt[0] && tcnt[1] == cnt[1]) {
            ans++;
        }
    }
    cout << ans << '\n';
    return 0;
}