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

using namespace std;

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


vector<int> a[111111];
int l[111111],c[111111];

int main()
{
    int n,m,i,s,x,y,st,dr,k=0;
    in>>n>>m;
    for(i=1;i<=m;++i)
    {
        in>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    for(i=1;i<=n;++i)
    {
        l[i]=-1;
    }
    for(i=1;i<=n;++i)
    {
        if(l[i]!=-1)
        {
            continue;
        }
        ++k;
        c[1]=i;
        l[i]=0;
        st=dr=1;
        while(st<=dr)
        {
            for(i=0;i<a[c[st]].size();++i)
            {
                if(l[a[c[st]][i]]==-1)
                {
                    c[++dr]=a[c[st]][i];
                    l[c[dr]]=l[c[st]]+1;
                }
            }
            st++;
        }
    }
    out<<k;
    return 0;
}