#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100;
vector < int > vec[MAXN + 1];
bitset < MAXN + 1 > viz;
void dfs ( int nod ) {
    viz[nod] = 1;
    int i;
    for ( i = 0 ; i < vec[nod].size () ; i++ )
        if ( viz[vec[nod][i]] == 0 )
            dfs ( vec[nod][i] );
}
int main () {
    ifstream fin ( "dfs.in" );
    ofstream fout ( "dfs.out" );
    int n , m , i , x , y , com;

    fin >> n >> m;
    for ( i = 0 ; i < m ; i++ ) {
        fin >> x >> y;
        vec[x].push_back ( y );
        vec[y].push_back ( x );
    }
    com = 0;
    for ( i = 1 ; i <= n ; i++ ) {
        if ( viz[i] == 0 ) {
            com++;
            dfs ( i );
        }
    }
    fout << com << '\n';
    return 0;
}