#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5;
vector<int> G[NMAX + 1];
int vis[NMAX + 1];

ifstream f("dfs.in");
ofstream g("dfs.out");

void dfs(int node) {
    vis[node] = 1;
    for(auto next : G[node]) {
        if(vis[next] == 0) {
            dfs(next);
        }
    }
}


int main() {
    int n, m;
    f >> n >> m;
    while(m--) {
        int a, b;
        f >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    int nr = 0;
    for(int i = 1; i <= n; i++) {
        if(vis[i] == 0) {
            nr++;
            dfs(i);
        }
    }
    g << nr;
    return 0;
}