// Source: https://usaco.guide/general/io

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

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

void dfs(int nod) {
    //cout << nod << ' ';
    vis[nod] = 1;
    for(int i = 0; i < L[nod].size(); i++) {
        int vecin = L[nod][i];
        if(!vis[vecin]) {
            dfs(vecin);
        }
    }
}

int main() {
    ifstream cin("dfs.in");
    ofstream cout("dfs.out");
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    //dfs(1);
    int cc = 0;
    for(int i = 1; i <= n; i++) {
        if(!vis[i]) {
            cc++;
            dfs(i);
        }
    }
    cout << cc;
}