#include <bits/stdc++.h>
#define ll long long
#define NMAX 100005

using namespace std;

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

bitset<NMAX> visited;
vector<int> edges[NMAX];

void dfs(int curr_node) {
    visited[curr_node] = 1;
    for(int i = 0; i < edges[curr_node].size(); i++) {
        int neighbour = edges[curr_node][i];
        if(!visited[neighbour])
            dfs(neighbour);
    }
}

int main() {
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;
        edges[x].push_back(y);
        edges[y].push_back(x);
    }
    int connected_comp = 0;
    for(int i = 1; i <= n; i++)
        if(!visited[i]) {
            connected_comp++;
            dfs(i);
        }

    fout << connected_comp;
}