#include <iostream>
#include <vector>
#include <fstream>
#define MAXn 100000
#define MAXm 200000
using namespace std;

vector<int> v[MAXn+1];
bool viz[MAXn+1];
int n,m;
ifstream f("dfs.in");
ofstream g("dfs.out");
void DFS(int i)
{
    viz[i]=true;
    for(int j=0;j<v[i].size();j++)
        if(!viz[v[i][j]])
            DFS(v[i][j]);
}


int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        f>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    int rez=0;
    for(int i=1;i<=n;i++)
        if(!viz[i])
        {
            rez++;
            DFS(i);
        }
    g<<rez;
    f.close();
    g.close();
    return 0;
}