#include <fstream>
#include <stack>
#include <vector>
using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

const int MAX_N = 100010;

vector<int> graf[MAX_N];
bool visited[MAX_N];
bool passed[MAX_N];

int N, M;

int dfs(int node);

int main(int argc, char const *argv[])
{
    fin >> N >> M;
    for (int i = 0; i < M; ++i) {
        int x, y;
        fin >> x >> y;
        graf[x].push_back(y);
        graf[y].push_back(x);
    }

    int result = 0;
    for (int i = 1; i <= N; ++i) {
        if (!passed[i]) {
            int nr = dfs(i);
            if (nr > result) {
                result = nr;
            }
        }
    }
    fout << result;

    return 0;
}

int dfs(int node) {
    passed[node] = true;
    int gs = 1;
    visited[node] = true;
    for (int i = 0; i < graf[node].size(); ++i) {
        if (visited[graf[node][i]] == false) {
            gs += dfs(graf[node][i]);
        }
    }
    visited[node] = false;
    return gs;
}