#include <bits/stdc++.h>

using namespace std;

ifstream f("dfs.in");
ofstream g("dfs.out");

int a[101][101];
int viz[100001];
int n;

void dfs(int x)
{
    viz[x] = 1;
    int y;
    for(y = 1; y <= n; y++)
    {
        if(a[x][y] == 1 and viz[y] == 0)
            dfs(y);
    }
}

int main()
{
    int x,y,m,i,j,cnt = 0;
    f >> n >> m;
    for(i = 1; i <= m; i++)
    {
        f >> x >> y;
        a[x][y] = 1;
        a[y][x] = 1;
    }
    for(i = 1; i <= n; i++)
    {
        if(viz[i] == 0)
        {
            dfs(i);
            cnt++;
        }
    }
    g << cnt;
    return 0;
}