#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int MAXN = 1e5 + 5;
vector <int> g[MAXN];
int seen[MAXN], ans;
void dfs(int node){
    seen[node] = 1;
    for(auto y : g[node]){
        if(!seen[y]) dfs(y);
    }
}
int main()
{
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i = 1; i <= n; ++i){
        if(!seen[i]) dfs(i), ans++;
    }
    fout << ans;
    return 0;
}