#include <iostream>
#include <vector>

using namespace std;

int maxLength = 0;

vector<vector<int>> adj;
vector<bool> visited;
vector<int> depth;

void dfs(int currNode)
{
    for(int newNode : adj[currNode]){
        if(visited[newNode]){
            maxLength = max(maxLength, depth[currNode] - depth[newNode] + 1);
        }
        else{
            depth[newNode] = depth[currNode] + 1;
            visited[newNode] = true;
            dfs(newNode);
        }
    }
}

int main()
{
    int N, M;
    cin >> N >> M;

    adj.resize(N+1);
    visited.assign(N+1, false);
    depth.assign(N+1, 0);

    for(int i = 0; i < M; ++i){
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    for(int i = 1; i <= N; i++){
        if(!visited[i]){
            visited[i] = true;
            dfs(i);
        }
    }
    cout << maxLength;
    return 0;
}