#include <fstream>
#include <vector>
#include <algorithm>
#define f in
#define g out

using namespace std;
ifstream in ( "dfs.in" );
ofstream out( "dfs.out" );
int n, m, i, x, y, cc;
vector<int> L[100009];
int fr[100009];

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


int main() {
    f>>n>>m;
    for ( ; m--; ){
        f>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    for ( i=1; i <= n; i++ )
        if ( !fr[i] )
            cc++, dfs(i);
    g<<cc;
    return 0;
}