/// Craciun Catalin
///  DFS
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>

#define NMax 1000001

using namespace std;

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

long n, m;
vector<long> A[NMax];
bool V[NMax];
int comp = 0;

void dfs (int nod) {

    V[nod] = true;
    for (unsigned int i=0;i<A[nod].size();i++)
        if (!V[A[nod][i]])
            dfs(A[nod][i]);
}

int main() {

    f>>n>>m;
    for (long i=1;i<=n;i++) {
        int x, y;
        f>>x>>y;
        A[x].push_back(y);
        A[y].push_back(x);
    }

    for (int i=1;i<=n;i++)
        if (!V[i]) {
            comp++;
            dfs(i);
        }

    g<<comp<<'\n';

    f.close(); g.close();

    return 0;
}