#include <fstream>
#include <vector> 


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


using namespace std;


vector <int> G[100005];


int n, m, x, y, cnt;
bool visited[100005];


void DFS(int node){
     visited[node] = True;
     for (int i = 0; i < G[node].size(); ++i){
          if (!visited[G[node][i]]){
               DFS(G[node][i]);
          }
     }
}



int main()
{
     cin >> n >> m;
     
     // citire
     for (int i = 0; i < m; ++i)
     {
          cin >> x >> y;
          G[x].push_back(y);
          G[y].push_back(x);
     }
     
     
     //cautare si afisare comp_Conexe
     for(int i = 1; i <= n; ++i){
          if (visited[i] == 0)
          {
               ++cnt;
               DFS(i);
          }
     }
     cout << cnt;
     return 0;
}