#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>

#define MAX_N 1000001

using namespace std;
int n, m, i, x, y, viz[MAX_N];
ifstream f("dfs.in");
ofstream g("dfs.out");

void addEdge(vector<int> adj[], int u, int v)
{
    adj[u].push_back(v);
    adj[v].push_back(u);
}
vector<int> adj[MAX_N];

int G[MAX_N], S[MAX_N], Cost[MAX_N], L, Start;


void DFS(int nod){
    viz[nod] = 1;
    //g << nod << " ";
    for (int i=0; i<G[nod]; i++)
        if (viz[adj[nod][i]] == 0)
            DFS(adj[nod][i]);
}

int main()
{
    f >> n >> m;
    for (i=1; i<=m; i++){
        f >> x >> y;
        addEdge(adj,x,y);
    }

    for (i = 1; i <= n; i++)
		G[i] = adj[i].size();

    int nr = 0;
    for (i=1; i<=n; i++)
        if (viz[i] == 0){
            nr++;
            DFS(i);
        }
    g << nr;
    return 0;
}