#include <fstream>
#include <vector>

#define MAX_N 100002

using namespace std;

vector<int> graph[MAX_N];
bool subset[MAX_N];


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


void addEdge (int a, int b){
  graph[a].push_back(b);
  graph[b].push_back(a);
}

void initialize() {
  for(int i = 0;i < MAX_N;++i)
    subset[i] = false;
}

void dfs(int a){
  subset[a] = 1;

  for (int neighbour : graph[a])
    if (!subset[neighbour])
      dfs(neighbour);
}


int main(){
  int n, m;
  in >> n >> m;

  int a, b;
  for (int i = 0; i < m; i ++){
    in >> a >> b;
    addEdge(a, b);
  }

  int noSubsets = 0;
  for (int i = 1; i <= n; i ++){
    if (!subset[i]){
        dfs(i);
        noSubsets ++;
    }
  }
  out << noSubsets;
}