#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
#define pb push_back
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n ,m, x, y, s, el_conex;
bitset <100005> viz;
vector <int> vecin[100005];
void read(){
  f >> n >> m;
  for(int i = 1; i <= m; ++i){
    f >> x >> y;
    vecin[x].pb(y);
    vecin[y].pb(x);
  }
}
void dfs(int x){
  viz[x] = 1;
  for(int i = 0; i < vecin[x].size(); ++i)
    if(!viz[vecin[x][i]]){
      viz[vecin[x][i]] = viz[x];
      dfs(vecin[x][i]);
       s++;
  }
}
int main()
{
    read();
    for(int i = 1; i <= n; ++i){
     if(!viz[i]){
        s = 1;
        dfs(i);
        if(s > el_conex) el_conex = s;
     }
    }
    g << el_conex;
    return 0;
}