#include <fstream>
#include <vector>
#define NMAX 102

using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

//graf reprezentat prin liste de adiacenta alocate static
int n,nrc;
vector <int> A[NMAX];
int viz[NMAX];

void citire();
void dfs(int x);

int main()
{
    int i;
    citire();
    for(i=1;i<=n;i++)
    {
        if(!viz[i])
        {
            nrc++;
            dfs(i);
        }
    }
    fout<<nrc;
    return 0;
}

void citire()
{
    int m,x,y;
    fin>>n>>m;
    while(fin>>x>>y)
    {
        A[x].push_back(y);
        A[y].push_back(x);
    }
}
void dfs(int x)
{
    int i;
    viz[x]=nrc;
    //parcurg vecini lui x
    for(i=0;i<A[x].size();i++)
    {
        if(!viz[A[x][i]])
            dfs(A[x][i]);
    }
}