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

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

void DFS(int x, vector<bool>& check, vector<vector<int>> adj)
{
    check[x] = true;

    if (adj[x].empty())
        return;

    for (int i = 0; i <= adj[x].size() - 1; i++)
    {
        int neigh = adj[x][i];
        if (!check[neigh])
            DFS(neigh, check, adj);
    }
}

int main()
{
    int n, m, nr = 0;
    f >> n >> m;
    vector<vector<int>> adj(n + 1);
    for (int i = 1, x, y;i <= m;i++)
    {
        f >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    vector<bool> check(n + 1, false);
    for (int i = 1;i <= n;i++)
        if (!check[i])
        {
            nr++;
            DFS(i, check, adj);
        }

    g << nr;

    return 0;
}