1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int maxn = 1010;
 4 int uf[maxn],d[maxn];
 5 int Find(int x) {
 6     if(x != uf[x]) uf[x] = Find(uf[x]);
 7     return uf[x];
 8 }
 9 int main() {
10     int n,m,u,v;
11     while(scanf("%d",&n),n) {
12         scanf("%d",&m);
13         for(int i = 0; i < maxn; ++i) {
14             uf[i] = i;
15             d[i] = 0;
16         }
17         for(int i = 0; i < m; ++i) {
18             scanf("%d%d",&u,&v);
19             ++d[u];
20             ++d[v];
21             u = Find(u);
22             v = Find(v);
23             if(u != v) uf[v] = u;
24         }
25         int tot = 0;
26         for(int i = 1; i <= n; ++i)
27             if(uf[i] == i) ++tot;
28         for(int i = 1; i <= n; ++i)
29             if(d[i]&1) tot++;
30         puts(tot > 1?"0":"1");
31     }
32     return 0;
33 }