#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;


struct unionfind {
    vector<int> d;
    vector<int> cnt;
    unionfind(int n = 0) : cnt(n) {
        d = vector<int>(n, -1);
    }

    int find(int x) {
        if (d[x] < 0) return x;
        return d[x] = find(d[x]);
    }

    bool unite(int x, int y) {
        int rx = find(x);
        int ry = find(y);
        if (rx == ry) {
            cnt[rx]++;
            return false;
        }
        if (d[rx] > d[ry]) swap(rx, ry);
        d[rx] += d[ry];
        d[ry] = rx;
        cnt[rx] = max(cnt[rx], cnt[ry]) + 1;
        return true;
    }

    bool same(int x, int y) { return find(x) == find(y); }

    int size(int x) { return -d[find(x)]; }
};



int main()
{
    int n, m;
    cin >> n >> m;
    
    unionfind uf(n);
    vi<int> u(m), v(m);
    rep(i, m) cin >> u[i] >> v[i];
    rep(i, m) u[i]--, v[i]--;

    for (int i = m - 1; i >= 0; i--) uf.unite(u[i], v[i]);
    int rt = uf.find(0);
    cout << uf.cnt[rt] << endl;
    return 0;
}