There are N cards placed face down in a row. On each card, an integer 1 or 2 is written.

Let A_i be the integer written on the i-th card.

Your objective is to guess A_1, A_2, ..., A_N correctly.

You know the following facts:

* For each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.



You are a magician and can use the following magic any number of times:

Magic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.

What is the minimum cost required to determine all of A_1, A_2, ..., A_N?

It is guaranteed that there is no contradiction in given input.

Constraints

* All values in input are integers.
* 2 \leq N \leq 10^5
* 1 \leq M \leq 10^5
* 1 \leq X_i < Y_i \leq N
* 1 \leq Z_i \leq 100
* The pairs (X_i, Y_i) are distinct.
* There is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)

Input

Input is given from Standard Input in the following format:


N M
X_1 Y_1 Z_1
X_2 Y_2 Z_2
\vdots
X_M Y_M Z_M


Output

Print the minimum total cost required to determine all of A_1, A_2, ..., A_N.

Examples

Input

3 1
1 2 1


Output

2


Input

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


Output

2


Input

100000 1
1 100000 100


Output

99999
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		Rot.init(System.in);
		int N=Rot.nextInt();
		int M=Rot.nextInt();
				
		disj d=new disj(N);
		
		for(int x=0;x<M;x++) {
			int X=Rot.nextInt();
			int Y=Rot.nextInt();
			int Z=Rot.nextInt();
			
			d.union(X-1, Y-1);
		}
		
		int[] ans=new int[N];
		
		for(int g=0;g<N;g++) {
			ans[d.find(g)]=1;
		}
		
		int count=0;
		for(int h=0;h<N;h++) {
			count+=ans[h];
		}
		System.out.println(count);

	}

}

class elem{
	int data;
	int rank;
}

class disj{
	elem[] arr;
	
	disj(int n){
		arr=new elem[n];
		
		for(int i=0;i<n;i++) {
			arr[i]=new elem();
			arr[i].data=i;
			arr[i].rank=1;
		}
	}
	
	int find(int x) {
		if(arr[x].data==x) {
			return x;
		}
		else {
			return arr[x].data=find(arr[x].data);
		}
	}
	
	void union(int a,int b){
		unify(find(a),find(b));
	}
	
	void unify(int a,int b){
		if(arr[a].rank>arr[b].rank) {
			arr[b].data=a;
		}
		else {
			arr[a].data=b;
			
			if(arr[a].rank==arr[b].rank) {
				arr[b].rank+=1;
			}
		}
	}
}


/** Class for buffered reading int and double values */
class Rot {
	static BufferedReader reader;
	static StringTokenizer tokenizer;

	/** call this method to initialize reader for InputStream */
	static void init(InputStream input) {
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}

	/** get next word */
	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens()) {
			// TODO add check for eof if necessary
			tokenizer = new StringTokenizer(reader.readLine());
		}
		return tokenizer.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}
	
	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
}


