#include <bits/stdc++.h>

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

vector <int> graf[100005];
bool visited[100005];

void dfs(int node)
{
    visited[node] = true;
    for(auto x : graf[node])
        if(!visited[x])
            dfs(x);
}

int main()
{
    int n, m;
    f >> n >> m;
    while(m--)
    {
        int x, y;
        f >> x >> y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }
    int ans=0;
    for(int i = 1; i <= n; ++i)
    {
        if(visited[i] == false)
        {
            ans++;
            dfs(i);
        }
    }
    g<<ans<<" ";
    return 0;
}