#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
int n,m,v[100];
int nr=0;
vector <vector <int> > graph;
void dfs(int vertex)
{
    int i;
    stack <int> s;
    int element;
    bool found;
    s.push(vertex);
    nr++;
    v[vertex]=nr;
    while(!s.empty())
    {
        element=s.top();
        found=false;
        for(i=0;i<graph[element].size() && found==false;i++)
        {
            if(v[graph[element][i]]==0)
                found=true;
        }
        if(found)
        {
            i--;
            s.push(graph[element][i]);
            v[graph[element][i]]=nr;
        }
        else
            s.pop();
    }
}
int main()
{
    int i,a,b;
    ifstream f("dfs.in");
    f>>n>>m;
    graph.resize(n+1);
    for(i=0;i<m;i++)
        {
            f>>a>>b;
            a--;
            b--;
            graph[a].push_back(b);
            graph[b].push_back(a);
        }
    for(i=0;i<n;i++)
        v[i]=0;
    for(i=0;i<n;i++)
        if(v[i]==0)
            dfs(i);
    ofstream g("dfs.out");
    g<<nr;
    return 0;
}