#include<vector>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<fstream>

using namespace std;

fstream f("dfs.in");
fstream g("dfs.out");

const int MAX_N = 100000;

vector <int> a[MAX_N],viz;

void dfs(int n)
{
  queue <int> c;
  c.push(n);
  viz[n]=true;
  while(!c.empty())
  {
    vector <int>::iterator it;
    int x=c.front();
    //c.pop();
    for(it=a[x].begin();it!=a[x].end();it++)
    {
      if(!viz[*it])
      {
        viz[*it]=true;
        c.push(*it);
        break;
      }
     }
  if( it == a[x].end())
    c.pop();
  }
}


int main()
{
  int n,m,n1,n2,k=0;
  f>>n>>m;
  int i,j;
  for(j=0;j<m;++j)
  {
    f>>n1>>n2;
    if( (n1-1) < 0 || (n2-1) < 0  )
      while(1);
    a[n1-1].push_back(n2-1);
    a[n2-1].push_back(n1-1);
  }
  f.close();
 return 0;
  viz.resize(n);
  viz.assign(viz.size(), false);
  for(i=0;i<n;i++)
     if(!viz[i])
     {
        dfs(i);
        k++;
      }
  g<<k;
  g.close();
  return 0;
}