#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#define Nmax 100009
#define pb push_back
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");

int N,M,sol,x,y;
vector < int > G[Nmax];
stack < int > st;

void GetCC(int S)
{
    for( st.push(S); !st.empty();)
    {
        int node = st.top();
        if(G[node].size()>0)
        {
            int fiu=G[node].back();
            st.push(fiu);
            G[node].pop_back();
            G[fiu].erase(find(G[fiu].begin(),G[fiu].end(),node));
        }
        else st.pop();
    }
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>x>>y , G[x].pb(y) , G[y].pb(x);
    for (int i=1; i<=N; ++i)
      if (G[i].size()>0)
        ++sol , GetCC(i);
    g<<sol<<'\n';
    f.close(); g.close();
    return 0;
}