#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll p[50005];
ll n,m,ans;
ll find(ll x){
    return p[x]=(p[x]==x?p[x]:find(p[x]));
}
void join(ll a,ll b){
    if(find(a)!=find(b)){
        p[find(a)]=find(b);
        //n--;
    } 
}
int main(){
    freopen("religion.in","r",stdin);
    freopen("religion.out","w",stdout);
    cin>>n>>m;
    for(ll i=1;i<=n;i++) p[i]=i;
    for(ll i=0;i<m;i++){
        ll a,b;
        cin>>a>>b;
        join(a,b);
    }
    for(ll i=1;i<=n;i++){
        if(find(i)==i){
            ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}