#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#define N 10000010

int f[N], num[N];

int Find(int x)
{
    if(x != f[x])
        f[x] = Find(f[x]);
    return f[x];
}

int main()
{
    int n, i, x, y, rx, ry, Max;
    while(scanf("%d", &n) != EOF)
    {
        for(i = 0 ; i <= N ; i++)
        {
            f[i] = i;
            num[i] = 1;
        }
        while(n--)
        {
            scanf("%d%d", &x, &y);
            rx = Find(x);
            ry = Find(y);
            if(rx != ry)
            {
                f[ry] = rx;
                num[rx] += num[ry];
            }
        }
        Max = 1;
        for(i = 0 ; i < N ; i++)
        {
            if(f[i] == i && Max < num[i])
                Max = num[i];
        }
        printf("%d\n", Max);
    }
    return 0;
}