#define MAX_N 100000

#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>
using namespace std;

ifstream fin("biconex.in");
ofstream fout("biconex.out");

int n, m, cb, cnt;
vector<int> G[MAX_N + 1];
bitset<MAX_N + 1> invalid;
int vizitat[MAX_N + 1];

void Invalideaza(int nod);
int Df(int nod);

int main()
{
    fin >> n >> m;

    for (int i = 1, x, y; i <= m; ++i)
    {
        fin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }

    for (int i = 1; i <= n; ++i)
    {
        if (G[i].size() <= 1)
        {
            Invalideaza(i);
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        if (!invalid[i] && !vizitat[i])
        {
            Df(i);
        }
    }

    fout << cb;

    fin.close();
    fout.close();
    return 0;
}

void Invalideaza(int nod)
{
    ++cb;
    invalid[nod] = true;

    if (G[G[nod].front()].size() <= 2)
    {
        Invalideaza(G[nod].front());
    }
}

int Df(int nod)
{
    vizitat[nod] = ++cnt;

    int res = 1 << 30;
    for (int vecin : G[nod])
    {
        if (invalid[vecin] || (vizitat[vecin] == 0)) { continue; }
        res = min(res, vizitat[vecin]);
    }

    int aux = 1 << 30;
    for (int vecin : G[nod])
    {
        if (invalid[vecin]) { continue; }

        if (vizitat[vecin] == 0)
        {
            aux = min(aux, Df(vecin));
        }
    }

    if (aux == vizitat[nod])
    {
        ++cb;

        for (int vecin : G[nod])
        {
            if (invalid[vecin] || (vizitat[vecin] > vizitat[nod])) { continue; }

            ++cb;
        }
    }

    res = min(res, aux);
    return res;
}