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

const int MAX = 100005;
vector<int> visited, graph[MAX];

void dfs(int node)
{
    visited[node] = 1;
    for (int next : graph[node])
        if (!visited[next])
            dfs(next);
}

int main()
{
    ifstream fin("dfs.in");
    ofstream fout("dfs.out");
    int n, m;
    fin >> n >> m;
    visited.assign(n+1, 0);

    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }

    int cnt = 0;
    for (int i = 1; i <= n; ++i)
        if (!visited[i])
        {
            ++cnt;
            dfs(i);
        }

    fout << cnt;

    return 0;
}