#include <iostream>
#include <vector>
#include <fstream>

void dfs(std::vector<std::vector<int>>& adj, std::vector<bool>& visited, int node) {
    visited[node] = true;
    for(auto i: adj[node]) {
        if(!visited[i]) {
            dfs(adj, visited, i);
        }
    }
}


int main() {
    std::ifstream fin("dfs.in");
    std::ofstream fout("dfs.out");
    
    int n, m;
    fin >> n >> m;
    std::vector<std::vector<int>> adj(n+1);
    for(int i = 1; i <= m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    std::vector<bool> visited(n+1, false);
    int cnt = 0;
    for(int i = 1; i <= n; i++) {
        if(!visited[i]) {
            dfs(adj, visited, i);
            cnt++;
        }
    }
    fout << cnt;
    fin.close();
    fout.close();
}