#include <bits/stdc++.h>

using namespace std;

int n, m, sol, m1, m2;
vector<vector<int>> adj(100005);
vector<bool>viz(100005,0);

ifstream fin("dfs.in");
ofstream fout("dfs.out");

void dfs(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i < adj[nod].size(); i++)
    {
        if(viz[adj[nod][i]] == 0)
        {
            dfs(adj[nod][i]);
        }

    }

}
int main()
{

    fin>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        fin>>m1>>m2;
        adj[m1].push_back(m2);
        adj[m2].push_back(m1);
    }

    for(int i = 1; i <= n; i++)
        if(viz[i] == 0)
        {
            dfs(i);
            sol++;
        }

    fout<<sol;
    fin.close();
    fout.close();
}