#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("dfs.in");
ofstream fo("dfs.out");

int n, m, i, l, c, nc,nconx;
bool a[2000][2000], v[2000];

void dfs(int x) {
  int i;
  for (i = 1; i <= n; i++)
    if (a[nc][i] and  not v[i]) {
      v[i] = true;
      dfs(i);
    }
}

int main()
{
  fi >> n >> m;
  for (i = 1; i <= m; i++) {
    fi >> l >> c;
    a[l][c] = a[c][l] = true;
  }
  nc = 1;
  for (i = 1; i <= n; i++) {
    if(not v[i]) {
      v[i] = true;
      nconx++;
      dfs(i);
    }
  }
  fo<<nconx;
  return 0;
}