//
//  main.cpp
//  testprogram
//
//  Created by Yan Olerinskiy on 05/09/2019.
//  Copyright © 2019 Yan Olerinskiy. All rights reserved.
//

#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double

using namespace std;

const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

int n, m;
vector<vector<int>> g;
vector<int> dp, tin, num;
vector<bool> used, used1;
int timer = 0, cnt = 0;
map<pii, int> ww;

int dfs(int v, int p) {
    used[v] = 1;
    tin[v] = dp[v] = timer++;
    int r = 0;
    for (auto u: g[v]) {
        if (u == p) continue;
        if (used[u]) {
            dp[v] = min(dp[v], dp[u]);
        } else {
            r += dfs(u, v);
            if (dp[u] > tin[v]) {
                if (ww[{min(u, v), max(u, v)}] > 1) continue;
                r++;
                cnt++;
            }
        }
    }
    return r;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    freopen("points.in", "r", stdin);
//    freopen("points.out", "w", stdout);
    cin >> n >> m;
    dp.resize(n);
    g.resize(n);
    tin.resize(n);
    num.assign(n, 0);
    used.assign(n, 0);
    used1.assign(n, 0);
    int x, y;
    for (int i = 0; i < m; i++) {
        cin >> x >> y;
        x--;y--;
        g[x].pb(y);
        g[y].pb(x);
        ww[{min(x, y), max(x, y)}]++;
    }
    int mm = 0;
    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            int q = dfs(i, -1);
            mm = max(q, mm);
        }
    }
    int m = 0;
    for (int i = 0; i < n; i++) m = max(m, num[i]);
    cout << cnt - mm;
//    cout << cnt << " " << mm;
}