#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

int n, m;
bool v[100005];
vector<int> g[100005];

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

int main()
{
    int k = 0;
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    for(int i = 1; i <= n; i++)
    {
        if(v[i] == false)
        {
            dfs(i);
            k++;
        }
    }
    fout << k;
    return 0;
}