#include <iostream>
#include <vector>
#include <cmath>
#include <fstream>

using namespace std;

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

int use[256];
vector<int> v[256];

void dfs(int nod)
{
    use[nod] = 1;
    for (int i = 0; i < v[nod].size(); i++) {
        if (!use[v[nod][i]]) {
            dfs(v[nod][i]);
        }
    }
}

int main()
{
    int N, M, x, y, i, components = 0;
    fin >> N >> M;

    for (i = 1; i <= M; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }

    for (i = 1; i <= N; i++)
        if (!use[i])
        {
            dfs(i);
            components++;
        }

    fout << "Number of connected components: " << components << endl;

    return 0;
}