#include <bits/stdc++.h>
using namespace std;
vector<long long> adj[100005];
bool visited[100005];
long long n,m,x,y,cnt=0;

void dfs(long long s) {
if (visited[s]) return;
visited[s] = true;
for (auto u: adj[s]) {
dfs(u);
}
}

int main(){
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
cin >> n >> m;
for(long long i=1; i<=m; i++){
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
}
for(long long j=1; j<=n; j++){
    if(visited[j]==false){
        dfs(j);
        cnt++;
    }
}
cout << cnt;
}