#include <fstream>
#include <queue>
using namespace std;

ifstream cin("dfs.in");
ofstream cout("dfs.out");

int n, m, k, v[101][101], w[101];

void dfs(int x, int k) {
  w[x] = k;
  
  for (int i = 1; i <= n; ++i)
    if (v[i][x] && !w[i])
      dfs(i, k);
}

int main() {
  cin >> n >> m;
  for (int i = 1, a, b; i <= m; ++i) {
    cin >> a >> b;
    v[a][b] = v[b][a] = 1;
  }
    
  for (int i = 1; i <= n; ++i)
    if (w[i] == 0)
      dfs(i, ++k);
  
  cout << k;
  
  cin.close();
  cout.close();
  return 0;
}