#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

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

vector <vector<int>> adjacentList(100001);
int visited[100001];

void dfs(int node) {
    visited[node] = 1;
    for (int i = 0; i < adjacentList[node].size(); ++i) {
        int adjacentNode = adjacentList[node][i];
        if (!visited[adjacentNode]) {
            dfs(adjacentNode);
        }
    }
}

int main() {
    int n, m;
    f >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        f >> x >> y;
        adjacentList[x].push_back(y);
        adjacentList[y].push_back(x);
    }
    int cntComponents = 0;
    for (int i = 1; i <= n; ++i) {
        if (!visited[i]) {
            ++cntComponents;
            dfs(i);
        }
    }
    g << cntComponents;
    return 0;
}