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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;

public class P216B {
    public static void main(String[] args) {
	InputStream inputStream = System.in;
	OutputStream outputStream = System.out;
	InputReader in = new InputReader(inputStream);
	PrintWriter out = new PrintWriter(outputStream);
	Task solver = new Task();
	solver.solve(in, out);
	out.close();
    }

    static class Task {
	public void solve(InputReader in, PrintWriter out) {
	    int n = in.nextInt();
	    int m = in.nextInt();
	    Map<Integer, Set<Integer>> adj = new HashMap<>();
	    for (int q = 0; q < m; q++) {
		int a = in.nextInt();
		int b = in.nextInt();
		if (!adj.containsKey(a))
		    adj.put(a, new HashSet<>());
		if (!adj.containsKey(b))
		    adj.put(b, new HashSet<>());
		adj.get(a).add(b);
		adj.get(b).add(a);
	    }
	    Set<Integer> visited = new HashSet<>();
	    Stack<Integer> st = new Stack<>();
	    for (int k : adj.keySet())
		st.push(k);
	    int count = 0;
	    while (!st.empty()) {
		int e = st.pop();
		if (!visited.contains(e))
		    visited.add(e);
		else
		    continue;
		int cnt = 1;
		int parent = -1;
		int child = e;
		// System.out.print(e + "->");
		do {
		    boolean found = false;
		    if (parent != e && adj.get(child).contains(e) && cnt % 2 != 0) {
			// System.out.println("cycle " + cnt);
			adj.get(parent).remove(child);
			for (int x : adj.get(child))
			    adj.get(x).remove(child);
			adj.remove(child);
			count++;
			n--;
			break;
		    }
		    for (int x : adj.get(child)) {
			if (!visited.contains(x)) {
			    parent = child;
			    child = x;
			    found = true;
			    break;
			}
		    }
		    if (!found) {
			break;
		    }
		    cnt += 1;
		    // System.out.print(child + "->");
		    visited.add(child);
		} while (true);
	    }
	    out.println(count + n % 2);
	}
    }

    static class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
	    reader = new BufferedReader(new InputStreamReader(stream), 32768);
	    tokenizer = null;
	}

	public String next() {
	    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
		try {
		    tokenizer = new StringTokenizer(reader.readLine());
		} catch (IOException e) {
		    throw new RuntimeException(e);
		}
	    }
	    return tokenizer.nextToken();
	}

	public int nextInt() {
	    return Integer.parseInt(next());
	}

	public long nextLong() {
	    return Long.parseLong(next());
	}

	public String nextLine() {
	    try {
		return reader.readLine();
	    } catch (IOException e) {
		throw new RuntimeException(e);
	    }
	}

	public int[] nextIntArray(int n) {
	    int[] arr = new int[n];
	    for (int i = 0; i < n; i++)
		arr[i] = nextInt();
	    return arr;
	}

    }
}
