#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define N 10010

using namespace std;
ifstream f("date.in");
ofstream g("date.out");
vector <int>G[N];
bool viz[N];
int nr=1;

void DFS(int nod){
        viz[nod]=true;
    for(int i=0; i<G[nod].size(); i++){
        int x=G[nod][i];
        if(!viz[x])
            DFS(x);
    }

}


int main()
{

int n, x, y,m;
f>>n;
f>>m;

for (int i=1;i<=m;i++)
{
        f>>x >>y;
        G[x].push_back(y);
        G[y].push_back(x);

 }
 for(int i=1 ; i<=m; i++){

                if(!viz[i]){DFS(i); ++nr;}
 }

 g<<nr;

    return 0;
}