1 #include <set> //1027
2 #include <map>
3 #include <list>
4 #include <cmath>
5 #include <ctime>
6 #include <deque>
7 #include <queue>
8 #include <stack>
9 #include <cstdio>
10 #include <string>
11 #include <vector>
12 #include <cctype>
13 #include <cstring>
14 #include <sstream>
15 #include <fstream>
16 #include <cstdlib>
17 #include <cassert>
18 #include <iostream>
19 #include <algorithm>
20
21
22
23 using namespace std;
24
25 int g[1001][1001];
26
27 int main()
28 {
29 int n, m;
30 int x, y, i, j;
31 int sum;
32
33 while(cin >> n >> m)
34 {
35 memset(g, 0, sizeof(g));
36
37 for(i = 0; i < m; i++)
38 {
39 cin >> x >> y;
40 g[x][y] = g[y][x] = 1;
41 }
42 for(i = 1; i <= n; i++)
43 {
44 sum = 0;
45 for(j = 1; j <= n; j++)
46 sum += g[i][j];
47
48 if(sum % 2 == 1)
49 {
50 cout << '0' << endl;
51 break;
52 }
53 }
54 if(i == ++n)
55 cout << '1' << endl;
56 }
57
58 return 0;
59 }