#include <iostream>
#include <cstdio> 
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxn=1e6+8;
struct point{
	int left;
	int right;
}t[maxn];
int ans[maxn];
int main()
{
	int n;
	cin >> n;
	ans[1]=1;
	for(int i=1;i<=n;i++)
	{
		cin >> t[i].left >> t[i].right;
		if(t[i].left !=0)
			ans[t[i].left]+=1;
		if(t[i].right !=0)
			ans[t[i].right]+=1;	
	}
	cout << max_element(ans+1,ans+n+1) << endl;
	return 0;
}