#include <fstream>
#include <cstdio>
#include <vector>
#define VAL 100005

using namespace std;

int N, M, i, x;
int a, b, ans;
bool ok[VAL];
vector<int> v[VAL];

void dfs(int x)
{
    ok[x]=true;
    for (int i = 0; i < v[x].size(); i++)
      if (ok[v[x][i]]==false)
        dfs(v[x][i]);
}

int main()
{
    freopen("dfs.in", "r", stdin);   ///Denumire foldere in si out
    freopen("dfs.out", "w", stdout);
    scanf("%d %d", &N, &M);          ///Introduce N si M (nr de Noduri si Muchii)

    for (i=1; i<=M; i++)
    {
        scanf("%d %d", &a, &b);      ///Introduce M muchii
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for (i=1; i<=N; i++)
    {
        if (ok[i]==false)
        {
            ans++;
            dfs(i);
        }
    }
    printf("%d\n", ans);
    return 0;
}