#include <stdio.h>

typedef struct 
{
	int x1, x2, y1, y2;
} Node;

Node nd[5001];

int Solve(int N)
{
	int i, j, cnt;
	cnt = 0;
	for (i = 0; i < N; i++)
	{
		scanf("%d %d %d %d", &nd[i].x1, &nd[i].x2, &nd[i].y1, &nd[i].y2);
	}
	for (i = 0; i < N; i++)
	{
		for (j = 0; j < N; j++)
		{
			if (i == j)
			{
				continue;
			}
			if (nd[i].x1 >= nd[j].x1 && nd[i].x2 <= nd[j].x2 && nd[i].y1 >= nd[j].y1 && nd[i].y2 <= nd[j].y2)
			{
				cnt++;
				break;
			}
		}
	}
	return cnt;
}

int main()
{
	int N;
	while (scanf("%d", &N) != -1)
	{
		printf("%d\n", Solve(N));
	}
	return 0;
}