import sys
sys.setrecursionlimit(10 ** 8)

N,M = map(int,input().split())
edge = []
for _ in range(M):
    u,v = map(int,input().split())
    edge.append((u-1,v-1))

parent = [-1] * N
dat = [0] * N
def find(i):
    if parent[i] < 0:
        return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
    I = find(i)
    J = find(j)
    if I == J:
        dat[I] += 1
        return False
    if parent[I] < parent[J]:
        I,J = J,I
    u = max(dat[I],dat[J])
    parent[J] += parent[I]
    parent[I] = J
    dat[J] = u + 1
    return True
def isSame(i,j):
    return find(i) == find(j)

ans = 0

for u,v in reversed(edge):
    unite(u,v)
ans = max(dat)
print(ans)