#include <bits.stdc++.h>
using namespace std;


vector<int> L[100001];
bool vis[10001];

void dfs(int node) {
    vis[node] = true;
    for (int vec : L[node]) {
        if (vis[vec] == 1) {
            dfs(vec);
        }
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");
    for (int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        L[a].push_back(b);
        L[b].push_back(a);
    }
    
    int nr = 0;
    for (int i = 1; i <= n; i++) {
        if (vis[i] == 0) {
            nr++;
            dfs(i);
        }
    }
    
    fout << nr << "\n";
    return 0;
}