#include <cstdio>
#include <deque>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#define NMAX 100001
#define pb push_back
using namespace std;

FILE *f = freopen("dfs.in", "r", stdin);
FILE *g = freopen("dfs.out", "w", stdout);

bool viz[NMAX];
vector <int> G[NMAX];
deque <int> q;
int n, m;
int rez;

void read() {
    scanf("%d%d", &n, &m);
    for(int i = 1; i<=m; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        G[x].pb(y);
        G[y].pb(x);
    }
}

void bfs(int start) {
    viz[start] = true;
    q.pb(start);
    while(!q.empty()) {
        int nod = q.front();
        q.pop_front();
        for(int i = 0; i<G[nod].size(); i++) {
            if(!viz[G[nod][i]]) {
                q.pb(G[nod][i]);
                viz[G[nod][i]] = true;
            }
        }
    }
}

int solve() {
    for(int i = 1; i<=n; i++)
    if(!viz[i]) {
        rez ++;
        bfs(i);
    }
    return rez;
}
int main() {
    read();
    printf("%d ", solve());
    return 0;
}