#include <fstream>
#include <vector>
#include <queue>
using namespace std;
using pii = pair<int,int>;
const int nmax = 1e5 + 1;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector <int> g[nmax];
int n , m , x , y;
bool viz[nmax];
void dfs(int x)
{
    viz[x] = 1;
    for(auto it : g[x])
    {
        if(!viz[it]) dfs(it);
    }
}
signed main()
{
    cin >> n >> m;
    for(int i = 1 ; i <= m ; ++i)
    {
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    int cnt = 0;
    for(int i = 1 ; i <= n ; ++i)
    {
        if(!viz[i])
        {
            ++cnt;
            dfs(i);
        }
    }
    cout << cnt ;
    return 0;
}