#include <bits/stdc++.h>

using namespace std;
#define local
#ifdef local

template<class T>
void _E(T x) { cerr << x; }

void _E(double x) { cerr << fixed << setprecision(6) << x; }

void _E(string s) { cerr << "\"" << s << "\""; }

template<class A, class B>
void _E(pair<A, B> x) {
    cerr << '(';
    _E(x.first);
    cerr << ", ";
    _E(x.second);
    cerr << ")";
}

template<class T>
void _E(vector<T> x) {
    cerr << "[";
    for (auto it = x.begin(); it != x.end(); ++it) {
        if (it != x.begin()) cerr << ", ";
        _E(*it);
    }
    cerr << "]";
}

void ERR() {}

template<class A, class... B>
void ERR(A x, B... y) {
    _E(x);
    cerr << (sizeof...(y) ? ", " : " ");
    ERR(y...);
}

#define debug(x...) do { cerr << "{ "#x" } -> { "; ERR(x); cerr << "}" << endl; } while(false)
#else
#define debug(...) 114514.1919810
#endif
#define _rep(n, a, b) for (ll n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (ll n = (a); n >= (b); --n)
#define _for(n, a, b) for (ll n = (a); n < (b); ++n)
#define _rof(n, a, b) for (ll n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f3f3f
#define ll long long
#define db long double
#define eps 1e-3
#define bin(x) cerr << bitset<10>(x) << endl
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<ll, ll>
#define pdd pair<db, db>
#define endl "\n"
const ll mod = 1e9 + 7;
const ll maxn = 2e5 + 10;
const db pi = acos(-1.0);

ll qpow(ll a, ll b) {
    ll ret = 1;
    for (; b; a = a * a % mod, b >>= 1) {
        if (b & 1) {
            ret = ret * a % mod;
        }
    }
    return ret;
}

vector<ll> f(maxn), invf(maxn);

ll inv(ll a) {
    return qpow(a, mod - 2);
}

void prework() {
    f[0] = 1;
    _rep(i, 1, maxn - 1) {
        f[i] = f[i - 1] * i % mod;
    }
    invf[maxn - 1] = qpow(f[maxn - 1], mod - 2);
    for (ll i = maxn - 2; i >= 0; i--) {
        invf[i] = invf[i + 1] * (i + 1) % mod;
    }
}

ll C(ll n, ll m) {
    if (n > m || m < 0)return 0;
    if (n == 0 || m == n) return 1;
    ll res = (f[m] * invf[m - n] % mod * invf[n]) % mod;
    return res;
}

ll father[maxn]; //父节点
ll people[maxn]; //每个集合中的元素个数
ll ranks[maxn]; //秩

ll find(ll x)
{
    if (x != father[x])
        father[x] = find(father[x]);

    return father[x];
}

//合并并返回合并后的祖先序号
void Union(ll x, ll y)
{
    x = find(x);
    y = find(y);

    if (ranks[x] > ranks[y])
    {
        father[y] = x;

        //两者祖先相同时，实际没发生合并，只考虑祖先不同的情况
        if (x != y)
            people[x] += people[y];
    }
    else
    {
        father[x] = y;

        //两者祖先相同时，实际没发生合并，只考虑祖先不同的情况
        if (x != y)
            people[y] += people[x];

        if (ranks[x] == ranks[y]) //树高相同时让父节点的树高值加一
            ranks[y] += 1;
    }
}

//计算集合的个数
ll count_sets(ll n)
{
    ll cnt = 0;
    for (ll i = 1; i <= n; i++)
        if (find(i) == i)
            cnt++;

    return cnt;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll n, m;
    cin >> n >> m;
    _rep(i, 1, n){
        father[i] = i;
        people[i] = 1;
        ranks[i] = 0;
    }
    _rep(i, 1, m){
        ll u, v;
        cin >> u >> v;
        Union(u, v);

    }
    ll res = 0;
    _rep(i, 1, n){
        res = max(res, people[find(i)]);
    }

    cout << res << endl;
}

Measured memory_bytes: 11084