/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/
 
#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define inf 1<<30
#define eps 1.e-10
#define N 100100
#define mod 1999999973
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("dfs.in");
ofstream g("dfs.out");
int viz[N],n,m,x,y,t;
vector<int> v[N];
void dfs(int x)
{
	viz[x]=1;
	FIT(it,v[x])
	if(!viz[*it])
		dfs(*it);
}
int main ()
{
	f>>n>>m;
	FOR(i,1,m)
	{
		f>>x>>y;
		v[x].pb(y);
		v[y].pb(x);
	}
	FOR(i,1,n)
	if(!viz[i])
	{
		++t;
		dfs(i);
	}
	g<<t;
    return 0;
}