#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int N, M, rez = 0;

void solve(int i, vector<vector<int> > &V, vector<int> &VIZ)
{

    VIZ[i] = 1;

    for(vector<int>::iterator it=V[i].begin();it!=V[i].end();++it)
        if(!VIZ[*it])
            solve(*it, V, VIZ);

}

int main()
{

    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);

    scanf("%d %d", &N, &M);


    vector<vector<int> > V(N+1, vector<int>());

    vector<int> VIZ(N+1, 0);
/*
    for(int i=0;i<=N;++i)
    {

        V.push_back(vector<int>());
        VIZ.push_back(0);
    }
*/
    for(int i=1;i<=M;++i)
    {
        int X, Y;
        scanf("%d %d", &X, &Y);

        V[X].push_back(Y);
        V[Y].push_back(X);

    }

    for(int i=1;i<=N;++i)
    {
        if(!VIZ[i])
        {
            solve(i, V, VIZ);
            ++rez;
        }

    }
    /*
    for(vector<vector<int> >::iterator it=V.begin();it!=V.end();++it)
    {
        for(vector<int>::iterator it2=(*it).begin();it2!=(*it).end();++it2)
            cout<<*it2<<" ";
        cout<<"\n";
    }*/

    cout<<rez<<"\n";
    return 0;
}