#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

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

int N, M; // N - nr noduri, M - nr muchii
int islands = 0;
const int NMAX = 100005;

vector<int> adj[NMAX];
bool visited[NMAX];

void dfs(int node) {
    visited[node] = true;
    
    for(auto neighbour : adj[node])
        if (!visited[neighbour])
            dfs(neighbour);
            
}

void read() {
    
    fin >> N >> M;
    
    for(int i = 1; i <= M; i++) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
        
    }
    for(int i = 1; i <= N; i++)
        visited[i] = false;
    
    for(int i = 1; i <= N; i++)
        if (!visited[i]) {
            islands++;
            dfs(i);
        }
    
    
}

int main() {
    read();
    fout << islands << "\n";
    return 0;
}