#include <vector>
#include <fstream>

using namespace std;

vector <int> G[100100];
int viz[100100];

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

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

    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int nod1, nod2;
        fin >> nod1 >> nod2;
        G[nod1].push_back(nod2);
        G[nod2].push_back(nod1);
    }
    int comp = 0;
    for (int i = 1; i <= n; ++i)
        if (!viz[i]) {
            ++comp;
            dfs(i);
        }
    fout << comp;
    return 0;
}