#include<iostream>
#include<string.h>
#include<vector>
using namespace std;
vector <int> G[100002];int c,vis[100002],du[100002],ans[100002],p[100002];   //  1到c   p[i]： 第i个连通分支的 奇度数void dfs(int n)
{vis[n]=1;int len;ans[n]=c;len=G[n].size();            //i 点的连通分量的编号为ans[i]for(int i=0;i<len;i++)if(vis[G[n][i]]==0)dfs(G[n][i]);
}
int main()
{int i,j,n,m,s,e,temp=0;while(scanf("%d%d",&n,&m)!=EOF){for(i=0;i<=temp;i++)G[i].clear();temp=n;c=0;memset(vis,0,sizeof(vis));memset(du,0,sizeof(du));memset(p,0,sizeof(p));while(m--){            scanf("%d%d",&s,&e);du[s]++;  du[e]++;G[s].push_back(e);G[e].push_back(s);            // 图}for(i=1;i<=n;i++){if(vis[i]==0){c++;dfs(i);}}for(i=1;i<=n;i++)if(du[i]%2==1)p[ans[i]]++;int final=0;for(i=1;i<=n;i++){if(du[i]==0)continue;              //孤立的点 忽略if(p[ans[i]]!=-1)    //该店所处的连通分支 已经加过{            if(p[ans[i]]==0)final++;else                     final+=p[ans[i]]/2;                p[ans[i]]=-1;          //标记}}printf("%d\n",final);}return 0;
}

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int f[100003];
int visit[1000003];
int num[100003];
void ini(int n)
{int i;for(i=1;i<=n;i++){f[i]=i;visit[i]=0;num[i]=0;}
}
int find(int x)
{int r,i=x;while(x!=f[x])x=f[x];while(i!=x){r=f[i];f[i]=x;i=r;}return x;
}
void Union(int x,int y)
{visit[x]++;visit[y]++;x=find(x);y=find(y);if(x==y)return ;else {f[x]=y;}
}
int main()
{int n,m,i,k,sum,x,y;while(scanf("%d%d",&n,&m)>0){ini(n);for(i=1;i<=m;i++){scanf("%d%d",&x,&y);Union(x,y);}for(i=1;i<=n;i++)find(i);for(i=1;i<=n;i++){if(visit[i]%2==1){k=f[i];num[k]++;}}sum=0;for(i=1;i<=n;i++){if(visit[i]>0 && f[i]==i){if(num[i]==0)sum++;else if(num[i]>0)sum=sum+num[i]/2;}}printf("%d\n",sum);}return 0;
}

#include <iostream>
#include <stdio.h>
using namespace std;
const int maxv = 100000 + 2;
int odds[maxv]; /* 顶点 */
int du[maxv]; /* 每个顶点的度数 */
int p[maxv]; /* 并查集数组 */
bool used[maxv];
int scc[maxv]; /* scc个数 */
void init(int n)
{for(int i = 0; i <= n; ++i){odds[i] = 0;p[i] = -1;du[i] = 0;used[i] = 0;}
}
int utf_find(int x)
{if(0 <= p[x]){p[x] = utf_find(p[x]);return p[x];}return x;
}
void utf_union(int a, int b)
{int r1 = utf_find(a);int r2 = utf_find(b);if(r1 == r2)return;int n1 = p[r1];int n2 = p[r2];if(n1 < n2){p[r2] = r1;p[r1] += n2;}else{p[r1] = r2;p[r2] += n1;}
}
int main()
{int n = 0;int m = 0;int a = 0;int b = 0;int i = 0;int cnt = 0;while(scanf("%d%d", &n, &m) != EOF){init(n);cnt = 0;for(i = 1; i <= m; ++i){scanf("%d%d", &a, &b);du[a]++;du[b]++;utf_union(a, b);}for(i = 1; i <= n; ++i){int f = utf_find(i);if(!used[f]){used[f] = 1;scc[cnt++] = f;}if(1 == du[i]%2)odds[f]++;}int ret = 0;for(i = 0; i < cnt; ++i){if(0 == du[scc[i]])continue;if(0 == odds[scc[i]])++ret;elseret += odds[scc[i]]/2;}printf("%d\n", ret); }return 0;
}