#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

int n, m, x, y, rez;

vector<int> graph[200005];
int marked[200005];

void dfs(int k){
    int lim = graph[k].size();
    marked[k] = 1;
    for(int i = 0; i<lim; i++){
        if(marked[ graph[k][i] ] == 0){
            dfs(graph[k][i]);
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i = 0; i<m; i++){
        fin>>x>>y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }
    for(int i = 1; i<=n; i++){
        if(marked[i]==0){
            rez++;
            dfs(i);
        }
    }
    fout<<rez;
    return 0;
}