#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream cin ("dfs.in");
ofstream cout ("dfs.out");
vector<vector<int> > graf;
bitset <100001> f;
void dfs(int nod)
{
int j;
f[nod]=1;
for(j=0;j<graf[nod].size();j++)
{
int next=graf[nod][j];
if(f[next]==0)
dfs(next);
}
}
int main()
{
int n,m,a,b,i,nr=0;
cin>>n>>m;
graf.resize(n+1);
for(i=1;i<=m;i++)
{
cin>>a>>b;
graf[a].push_back(b);
graf[b].push_back(a);
}
for(i=1;i<=n;i++)
{
if(f[i]==0)
{
nr++;
dfs(i);
}
}
cout<<nr;
return 0;
}