216_B. Forming Teams
One day n students come to the stadium. They want to play football, and for that they need to split into teams, the teams must have an equal number of people.

We know that this group of people has archenemies. Each student has at most two archenemies. Besides, if student A is an archenemy to student B, then student B is an archenemy to student A.

The students want to split so as no two archenemies were in one team. If splitting in the required manner is impossible, some students will have to sit on the bench.

Determine the minimum number of students you will have to send to the bench in order to form the two teams in the described manner and begin the game at last.

Input

The first line contains two integers n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of students and the number of pairs of archenemies correspondingly.

Next m lines describe enmity between students. Each enmity is described as two numbers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — the indexes of the students who are enemies to each other. Each enmity occurs in the list exactly once. It is guaranteed that each student has no more than two archenemies.

You can consider the students indexed in some manner with distinct integers from 1 to n.

Output

Print a single integer — the minimum number of students you will have to send to the bench in order to start the game.

Examples

Input

5 4
1 2
2 4
5 3
1 4


Output

1

Input

6 2
1 4
3 4


Output

0

Input

6 6
1 2
2 3
3 1
4 5
5 6
6 4


Output

2
```python
def arr_inp():
    return [int(x) for x in stdin.readline().split()]


class graph:
    # initialize graph
    def __init__(self, gdict=None):
        if gdict is None:
            gdict = defaultdict(list)
        self.gdict = gdict

    # get edges
    def edges(self):
        return self.find_edges()

    # find edges
    def find_edges(self):
        edges = []
        for node in self.gdict:
            for nxNode in self.gdict[node]:
                if {nxNode, node} not in edges:
                    edges.append({node, nxNode})
        return edges

    # Get verticies
    def get_vertices(self):
        return list(self.gdict.keys())

    # add vertix
    def add_vertix(self, node):
        self.gdict[node] = []

    # add edge
    def add_edge(self, node1, node2):
        self.gdict[node1].append(node2)
        self.gdict[node2].append(node1)

    def dfsUtil(self, v, par):

        self.visit[v] = 1

        for i in self.gdict[v]:
            if self.visit[i] == 0:
                self.dfsUtil(i, v)
                self.topsort += 1
            elif i != par and v != par:
                self.topsort += 1
                self.flag = 1

    # dfs for graph
    def dfs(self):
        self.visit, self.cnt, self.topsort, self.flag = defaultdict(int), 0, 0, 0

        for i in self.get_vertices():
            if self.visit[i] == 0:
                self.dfsUtil(i, i)

                if self.topsort & 1 and self.topsort >= 3 and self.flag:
                    self.cnt += 1
                self.flag = 0
                self.topsort = 0
        return self.cnt


from collections import defaultdict
from sys import stdin

n, m = arr_inp()
student = graph()
for i in range(m):
    a, b = arr_inp()
    student.add_edge(a, b)

ans = student.dfs()
print(ans + 1 if (n - ans) & 1 else ans)

```