#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

#define pb push_back;

ifstream f ("dfs.in");
ofstream g ("dfs.out");

vector <int> l[100];
vector <int> :: iterator it;

int n,m,t[100];
bool sel[100];

void load ()
{
    int i,x,y;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        l[x].push_back(y);
        l[y].push_back(x);
    }
}

void dfs ( int x )
{
    vector <int> :: iterator it;
    sel[x]= true;
    for( it=l[x].begin(); it!=l[x].end(); it++ )
        if ( !sel[*it] )
        {
            t[*it]=x;
            dfs (*it);
        }
}

void print ()
{
    int nc=0,i;

    for(i=1; i<=n; i++)
        if(!sel[i])
        {
            nc++;
            dfs(i);
        }
    g<<nc;
}

int main()
{
    load();
    print ();

    return 0;
}