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

#define ll long long
#define ull unsigned long long

int read()
{
    int x = 0; bool f = false; char c = getchar();
    while(c < '0' || c > '9') f |= (c == '-'), c = getchar();
    while(c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return f ? -x : x;
}

const int N = 1e5 + 5;
int n, m;
int f[N], Size[N];
int find(int x){ return (x == f[x]) ? (f[x]) : (f[x] = find(f[x])); }
void merge(int x, int y)
{
    x = find(x), y = find(y);
    if(x == y) return ;
    if(x > y) swap(x, y);
    f[y] = x, Size[x] += Size[y];
}
int main()
{
    n = read(), m = read();
    for(int i = 1; i <= n; ++i) f[i] = i, Size[i] = 1;
    for(int i = 1; i <= m; ++i)
    {
        int u = read(), v = read();
        merge(u, v);
    }
    int cnt = 0, tot = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(find(i) == i)
        {
            if(Size[i] % 2 == 0)
            {
                cnt += Size[i] - 1;
                ++tot;
            }else
            {
                cnt += Size[i];
                ++tot;
            }
        }
    }
    if(tot % 2 == 0) printf("%d\n", n + m - cnt);
    else printf("%d\n", cnt);
    return 0;
}