#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>

using namespace std;

int main()
{
    freopen("dfs.in", "r", stdin);
    freopen("dfs.out", "w", stdout);
    vector<int> edges[100010];
    int n, m;
    scanf("%d", &n);
    scanf("%d", &m);
    for(int i = 0; i < m; ++i)
    {
        int a, b;

        scanf("%d", &a);
        scanf("%d", &b);
        edges[a].push_back(b);
        edges[b].push_back(a);
    }

    vector<int> v(n + 1, 0);
    int c = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(!v[i])
        {
            queue<int> s;
            s.push(i);
            v[i] = 1;
            while(!s.empty())
            {
                int nod = s.front();
                for(int j = 0; j < edges[nod].size(); ++j)
                {
                    int nod2 = edges[nod][j];
                    if(!v[nod2])
                    {
                        s.push(nod2);
                        v[nod2] = 1;
                    }
                }
                s.pop();
            }
            ++c;
        }
    }

    printf("%d", c);

    return 0;
}