#include<bits/stdc++.h>

using namespace std;


int viz[1005];
int n,pl,m,x,y,u,k=0;
int a[1005][1005];


void dfs(int pl){
	int j;
	//cout<<pl<<" ";
	viz[pl]=1;
	for(j=1;j<=n;j++)
		if((a[pl][j]==1)&&(viz[j]==0))
			dfs(j);
}


int main(){
	ifstream cin("dfs.in");
	ofstream cout("dfs.out");
	cin>>n;
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		a[x][y]=a[y][x]=1;
	}
	for (int i = 1; i <= n; i++) if (!viz[i]) { k++; dfs(i);}
	
	cout<<k;
	return 0;
}