def main():

    n,m=list(map(int,input().split()))

    ab=[[int(x)-1 for x in input().split()] for _ in range(m)]

    uf=UnionFind(n)

    for a,b in ab:

        uf.union(a,b)

    ans = 0

    for s in uf.roots():

        ans = max(uf.size(s),ans)

    print(ans)



class UnionFind():

    '''Union-Find'''

    

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n



    def find(self, x):

        if self.parents[x] < 0:

            return x

        else:

            self.parents[x] = self.find(self.parents[x])

            return self.parents[x]



    def union(self, x, y):

        x = self.find(x)

        y = self.find(y)



        if x == y:

            return



        if self.parents[x] > self.parents[y]:

            x, y = y, x



        self.parents[x] += self.parents[y]

        self.parents[y] = x



    def size(self, x):

        return -self.parents[self.find(x)]



    def is_same(self, x, y) -> bool:

        return self.find(x) == self.find(y)



    def members(self, x):

        root = self.find(x)

        return [i for i in range(self.n) if self.find(i) == root]



    def roots(self):

        return [i for i, x in enumerate(self.parents) if x < 0]



    def group_count(self):

        return len(self.roots())



    def all_group_members(self):

        return {r: self.members(r) for r in self.roots()}



    def __str__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

    

if __name__ == "__main__":

    main()
def main():

    n,m=list(map(int,input().split()))

    uf=UnionFind(n)

    for a,b in ([int(x)-1 for x in input().split()] for _ in range(m)):

        uf.union(a,b)

    print((max((uf.size(x) for x in uf.roots()))))



class UnionFind():

    '''Union-Find'''

    

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n



    def find(self, x):

        if self.parents[x] < 0:

            return x

        else:

            self.parents[x] = self.find(self.parents[x])

            return self.parents[x]



    def union(self, x, y):

        x = self.find(x)

        y = self.find(y)



        if x == y:

            return



        if self.parents[x] > self.parents[y]:

            x, y = y, x



        self.parents[x] += self.parents[y]

        self.parents[y] = x



    def size(self, x):

        return -self.parents[self.find(x)]



    def is_same(self, x, y) -> bool:

        return self.find(x) == self.find(y)



    def members(self, x):

        root = self.find(x)

        return [i for i in range(self.n) if self.find(i) == root]



    def roots(self):

        return [i for i, x in enumerate(self.parents) if x < 0]



    def group_count(self):

        return len(self.roots())



    def all_group_members(self):

        return {r: self.members(r) for r in self.roots()}



    def __str__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

if __name__ == "__main__":

    main()
def main():
    n, m = list(map(int, input().split()))
    ab = [[int(x) - 1 for x in input().split()] for _ in range(m)]
    uf = UnionFind(n)
    for a, b in ab:
        uf.union(a, b)
    ans = 0
    for s in uf.roots():
        ans = max(uf.size(s), ans)
    print(ans)


class UnionFind:
    """Union-Find"""

    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def is_same(self, x, y) -> bool:
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())


if __name__ == "__main__":
    main()

def main():
    n, m = list(map(int, input().split()))
    uf = UnionFind(n)
    for a, b in ([int(x) - 1 for x in input().split()] for _ in range(m)):
        uf.union(a, b)
    print((max((uf.size(x) for x in uf.roots()))))


class UnionFind:
    """Union-Find"""

    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def is_same(self, x, y) -> bool:
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())


if __name__ == "__main__":
    main()

-    ab = [[int(x) - 1 for x in input().split()] for _ in range(m)] -    for a, b in ab: +    for a, b in ([int(x) - 1 for x in input().split()] for _ in range(m)): -    ans = 0 -    for s in uf.roots(): -        ans = max(uf.size(s), ans) -    print(ans) +    print((max((uf.size(x) for x in uf.roots()))))