#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
bool viz[105];
vector<int> mat[100001];
int dist[100001];
void dfs(int node){
    dist[node] = 1;
    int k = mat[node].size();
    for(int i = 0; i < k; i++)
    {
        if(dist[mat[node][i]] == 0)
        {
            dfs(mat[node][i]);
        }
    }
}

int main()
{
    int n, m;
    int compcon=0;
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b;
        fin>>a>>b;
        mat[a].push_back(b);
        mat[b].push_back(a);
    }
    for(int i=1;i<=n;i++)
        if(dist[i]=0)
        {
            dfs(i);
            compcon++;
        }
    fout<<compcon;
    return 0;
}