#include <cstdio>
#include <vector>

#define NMAX 100000
using namespace std;
vector<int> G[NMAX];
int vizitat[NMAX],N,M,x,y,i,nrc;

void dfs(int nod)
{
    for (vector<int> :: iterator itt = G[nod].begin(); itt != G[nod].end(); ++itt)
    {
        int k = *itt;
        if (vizitat[k]==0)
        {
            vizitat[k]=1;
            dfs(k);
        }
    }
}

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

    scanf("%d %d", &N, &M);
    for (i=1; i<=M; i++)
    {
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for (i=1; i<=N; i++)
        if (vizitat[i]==0)
        {
            vizitat[i]=1;
            nrc++;
            dfs(i);
        }

    printf("%d", nrc);

    return 0;
}