#include <iostream>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <fstream>
#include <vector>
#include <list>
#include <stack>

void dfs(int N, int init_node, bool *visited, std::vector<std::list<int> > &adj) {
    std::stack<int> S;
    int curr_node;

    // Adaug nodul initial
    S.push(init_node);

    while(!S.empty()) {
        curr_node = S.top(); S.pop();

        if (!visited[curr_node]) {
            visited[curr_node] = true;
            for (std::list<int>::iterator neigh = adj[curr_node].begin(); neigh != adj[curr_node].end(); neigh++) {
                S.push(*neigh);
            }
        }
    }
}

int main(int argc, char **argv) {

    std::ifstream input("dfs.in");

    if (!input.is_open()) {
        std::cerr << "Cannot open input file!" << std::endl;
        std::exit(-1);
    }

    std::ofstream output("dfs.out");

    if (!output.is_open()) {
        std::cerr << "Cannot open output file!" << std::endl;
        input.close();
        std::exit(-2);
    }

    // Citire Graph
    int N, M, u, v;
    input >> N >> M;

    std::vector<std::list<int> > adj(N + 1, std::list<int>());
    bool visited[N + 1];
    std::memset(visited, true, N + 1);

    while(input >> u >> v) {
        adj[u].push_back(v);
        adj[v].push_back(u);
        visited[u] = false, visited[v] = false;
    }

    int scc = 0;

    // DFS
    for (int i = 1; i <= N; i++)
        if (!visited[i]) {
            dfs(N, i, visited, adj);
            scc++;
        }

    std::cout << scc << std::endl;
    input.close();
    output.close();

    return 0;
}