// bfs cu stl
#include <cstdio>
#include <queue>
#define max 100000

using namespace std;

int v,x,y,n,nr;
int viz[max],numara;

struct nod
{
    int nr;
    nod*urm;
};

nod *g[max];
queue <int> s;

void baga(int x, int y)
{
    nod *q=new nod;
    q->nr=y;
    q->urm=g[x];
    g[x]=q;
}

void read()
{
    freopen("dfs.in","r",stdin);
    v=1;
    scanf("%d%d",&n,&nr);
    for(int i=0;i<nr;i++)
    {
        scanf("%d%d",&x,&y);
        baga(x,y);
        baga(y,x);
    }
}

void adauga(int v2)
{
    nod *x=g[v2];
    while(x)
    {
        if(viz[x->nr]==0)
        {
            s.push(x->nr);
            viz[x->nr]=1;
        }
        x=x->urm;
    }
}

void bfs(int v)
{
    viz[v]=1;
    s.push(v);
    while(!s.empty())
    {
        int v2=s.front();
        s.pop();
        adauga(v2);
    }
}

int main()
{
    read();
    freopen("dfs.out","w",stdout);
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
        {
            numara++;
            bfs(i);
        }
    printf("%d\n",numara);
    fclose(stdout);
    return 0;
}