#include <bits/stdc++.h>
#define MAX 100005

using namespace std;

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

int n, m, x, y, rez=0;
vector <int> G[MAX];
bool viz[MAX];

void dfs (int node)
{
    int i, newnode;
    viz[node]=true;
    for (i=0; i<G[node].size(); i++)
    {
        newnode=G[node][i];
        if (viz[newnode]==false)
                dfs(newnode);
    }
}

int main()
{
    int i, j;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    for (i=1; i<=n; i++)
    {
        if(viz[i]==false)
        {
            rez++;
            dfs(i);
        }
    }
    cout<<rez;
    return 0;
}