#include <bits/stdc++.h>

using namespace std;

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

int N, M, x, y, conexe;

bool b[100005];
vector <int>g[100005];

void Dfs(int nod)
{
    b[nod] = 1;

    for(auto i:g[nod])
    {
        if(b[i] == 0)
        {
            Dfs(i);
        }
    }
}

int main()
{
    fin>>N>>M;

    for(int i = 1; i<=M; i++)
    {
        fin>>x>>y;

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

    for(int i = 1; i<=N; i++)
    {
        if(b[i] == 0)
        {
            Dfs(i);
            conexe++;
        }
    }

    fout<<conexe;

    return 0;
}