N,M=map(int,input().split())
par=[i for i in range(N)]
rank=[0]*(N)
friend=[0]*N
block=[0]*N
size=[1]*N
def find(x):
  if par[x]==x:
    return x
  else:
    par[x]=find(par[x])
    return par[x]
 
#同じ集合か判定
def same(x,y):
  return find(x)==find(y)
 
def union(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return 
  if rank[x]>rank[y]:
    par[y]=x
    size[x]+=size[y]
  else:
    par[x]=y
    size[y]+=size[x]
    if rank[x]==rank[y]:
      rank[y]+=1
 
A=[] 
for i in range(M):
  a,b=map(int,input().split())
  a-=1
  b-=1
  A.append((a,b,i))
A=A[::-1]
D=[0]*N
for a,b,i in A:
  if find(a)==find(b):
    D[find(a)]+=1
  else:
    aa,bb=D[find(a)],D[find(b)]
    union(a,b)
    D[find(a)]=max(aa,bb)+1
print(max(D))