#include <fstream>
#include <vector>
#define NMAX 200005
using namespace std;
ifstream in ("dfs.in");
ofstream out ("dfs.out");

int n,m;
vector <int> muchii[NMAX];
bool vizitat[NMAX];
int answer;

void DFS(int x)
{
    vizitat[x]=true;
    int nod_curent;
    for(auto i=muchii[x].begin();i!=muchii[x].end();i++){
        nod_curent=*i;
        if(!vizitat[nod_curent]){
            DFS(nod_curent);
        }
    }
}

int main()
{
    int i,x,y;
    in>>n>>m;
    for(i=1;i<=m;i++){
        in>>x>>y;
        muchii[x].push_back(y);
        muchii[y].push_back(x);
    }
    for(i=1;i<=n;i++){
        if(!vizitat[i]){
            DFS(i);
            answer++;
        }
    }
    out<<answer;
    return 0;
}