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

const int N = 100003;

ifstream f("dfs.in"); ofstream g("dfs.out");
int nrc,k,a[1005][1005],n,m,viz[100003];
vector <int> vecini [N];

void dfs(int nod) {
    int i;
    viz[nod] = k;
    for(i = 1; i < vecini[nod].size(); ++i) {
        if (viz[vecini[nod][i]] == 0) {
            dfs(vecini[nod][i]);
        }
    }
}

int main() {
    int i,j;
    f>>n>>m;
    for(i = 1; i <= 1000; ++i) {
        for(j = 1; j <= 1000; ++j) {
            a[i][j] = 0;
        }
    }
    for(i = 1; i <= n; ++i) {
        viz[i] = 0;
        vecini[i].push_back(0);
    }
    for(i = 1; i <= m; ++i) {
        int x,y;
        f>>x>>y;
        vecini[x].push_back(y);
        vecini[y].push_back(x);
    }
    nrc = 0;
    for(i = 1; i <= n; ++i){
        k = i;
        if (viz[i] == 0) {
            ++nrc;
            dfs(i);
        }
    }
    g<<nrc;
    return 0;
}