#include <stdio.h>
#include <deque>
using namespace std;
const int DIM = 100001;

int N, M, viz[DIM], C;
deque <int> V[DIM];

void dfs (int n)
{
	viz[n] = 1;
	deque <int> :: iterator it;
	for (it = V[n].begin (); it != V[n].end (); it++)
		if ( !viz[*it] )
			dfs (*it);	
}

int main ()
{
	freopen ("dfs.in", "r", stdin);
	freopen ("dfs.out", "w", stdout);
	
	scanf ("%d%d", &N, &M);
	for (int i = 0, a, b; i < M; i++)
	{
		scanf ("%d%d", &a, &b);
		V[a].push_back (b);
		V[b].push_back (a);
	}
	
	for (int i = 1; i <= N; i++)
		if ( !viz[i] )
		{
			C++;
			dfs (i);
		}

	printf ("%d", C);
	return 0;
}