#include <fstream>
#include <vector>

using namespace std;

ifstream be("dfs.in");
ofstream ki("dfs.out");

void dfs(const vector<vector<int>> &adj, vector<bool> &vis, const int &start)
{
    vis[start] = 1;

    for(int i : adj[start])
    {
        if(!vis[i])
        {
            dfs(adj, vis, i);
        }
    }
}

int main()
{
    int n, m;
    be >> n >> m;

    vector<bool> vis(n + 1);
    vector<vector<int>> adj(n + 1);

    int x, y;

    for(int i = 1; i <= m; i++)
    {
        be >> x >> y;

        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    int cnt = 0;

    for(int i = 1; i <= n; i++)
    {
        if(!vis[i])
        {
            dfs(adj, vis, i);
            cnt++;
        }
    }

    ki << cnt;

    return 0;
}