#include <iostream>
using namespace std;

int x[50], y[50], x2[50], y2[50];

bool overlap(int i, int j)
//
// determine if window <i> and window <j> overlap at all
//
{
	if (x2[i] < x[j])
		return false;
	if (x[i] > x2[j])
		return false;
	if (y2[i] < y[j])
		return false;
	if (y[i] > y2[j])
		return false;
	return true;
}


void main()
{
	int n;
	cin >> n;
	while (n != 0) {
		for(int k=0; k<n; k++) {
			cin >> x[k] >> y[k] >> y2[k] >> x2[k];
			x2[k] += x[k]-1;
			y2[k] += y[k]-1;
		}
		int count = 0;
		for(int i=0; i<n; i++)			// determine if window i overlaps with any other
			for(int j=0; j<n; j++) {
				if (i == j)
					continue;
				if (overlap(i, j)) {
					count++;			// only need one overlap, then break
					break;
				}
			}
		cout << count << endl;
		cin >> n;
	}
}