#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin("dfs.in");
ofstream cout("dfs.out");

vector <vector <int> > a;
vector <bool> v;
vector <int> c;

void read()
{
    int n,m,x,y;
    cin >> n >> m;
    a.resize(n+1);
    for ( ; m ; m--)
    {
        cin >> x >> y;
        if (x!=y)
        {
            a[x].push_back(y);
            a[y].push_back(x);
        }
    }
    v.resize(n+1);
}

bool NE(int x) //NE - Not Exist
{
    return count(c.begin(),c.end(),x)==0;
}

void solve()
{
    int mx=-1,cs;
    for (int i=1; i<v.size(); i++)
    {
        c.clear();
        if (!v[i])
        {
            c.push_back(i);
            for (int j=0; j<c.size(); j++)
            {
                for (int z=0; z<a[c[j]].size(); z++)
                    if (NE(a[c[j]][z]))
                    {
                        c.push_back(a[c[j]][z]);
                        v[a[c[j]][z]]=false;
                    }
            }
        }
        cs=c.size();
        mx=max(mx,cs);
    }
    cout << mx;
}

main()
{
    read();
    solve();
}