#include <iostream>
#include <stdio.h>
#include <vector>
#define NMax 100005
using namespace std;
vector<int> Graf[NMax];
int N,M,conex;
bool mark[NMax];

void Read()
{
    int x,y;
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&x,&y);
        Graf[x].push_back(y);
        Graf[y].push_back(x);
    }
}

void DFS(int nod)
{
    for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
      if(mark[*it]==false)
      {
          mark[*it]=true;
          DFS(*it);
      }

}

void Solve()
{
    for(int i=1;i<=N;i++)
        if(mark[i]==false)
        {
            DFS(i);
            conex++;
        }
}

void Write()
{
    printf("%d",conex);
}

int main()
{
    freopen("dfs.in","r",stdin);
    freopen("dfs.out","w",stdout);
    Read();
    Solve();
    Write();
}