#include <iostream.h>
#include <fstream.h>

int min = 300005, x, y, n, m[2][100000], max = 0;

int main()
{
	ifstream f ("cadrane.in");
	ofstream g ("cadrane.out");
	
	int i, j, s, k;
	
	f >> n;
	for(i = 0; i < n; i ++)
		f >> m[0][i] >> m[1][i];
	
	for(i = 0; i < n; i ++)
	{
		min = 300005;
		for(j = 0; j < n; j ++)
		{
			s = 0;
			y = m[1][j];
			x = m[0][i];
			for(k = 0; k < n; k ++)
			{
				if(x <= m[0][k] && y <= m[1][k])
					s ++;
				else
				if(x >= m[0][k] && y >= m[1][k])
					s ++;
			}
			if(min > s)
				min = s;
		}
		if(max < min)
			max = min;
	}
	
	g << max;
	
	f.close();
	g.close();
}