#include<stdio.h>
#include<stdlib.h>
#define MAX 30

struct slide {
	int xmin,xmax,ymin,ymax;
	int np;
	char letter;
	int present[MAX];
};

struct point{
	int x,y;
};

int k,n,test=0,ind;
struct point pvet[MAX];
struct slide svet[MAX];
int output[MAX];
int valid[MAX];



void count(){
	int i,j;
	
	for (i=0; i<n; i++){
		svet[i].np=0;
		svet[i].letter = i+'A';
		
		for(j=0; j<n; j++)
			svet[i].present[j] =0;
		
		for (j=0; j<n; j++) {	
			if ( (pvet[j].x>svet[i].xmin) &&	
			 	 (pvet[j].x<svet[i].xmax) &&
				 (pvet[j].y<svet[i].ymax) &&
				 (pvet[j].y>svet[i].ymin)) {
				 svet[i].np++;
				 svet[i].present[j] =1;
			}
		}
	}
}
				 
				 
int comp( const void *p1, const void *p2 )
{
	return ( (( struct slide* ) p1)->np - (( struct slide* ) p2)->np );
}

void elimina(int ind) {
	int i;
	for(i=0; i<k; i++)
		if (svet[i].present[ind]) {
			svet[i].present[ind] =0;
			svet[i].np--;
		}
}

int cercap() {
	int i;
	for(i=0; i<n; i++)
		if (svet[0].present[i]) return i;
}

void shift() {
	int i;
	
	for(i=0; i<k-1; i++)
		svet[i] = svet[i+1];
}

int main()
{
	int i;
	FILE *fp;
	fp = fopen( "slides.in", "r" );
	while(1) {
		
		test++;
		fscanf(fp," %d",&n);
		if (n==0) break;
		
		for (i=0; i<n; i++)
			output[i]=100;
		
		for (i=0; i<n; i++)
			fscanf(fp," %d %d %d %d",&svet[i].xmin,&svet[i].xmax,
					&svet[i].ymin,&svet[i].ymax);
					
		for (i=0; i<n; i++)
			fscanf(fp," %d %d",&pvet[i].x,&pvet[i].y);
					
		count();
		k=n;
		printf("Heap %d\n",test);
		qsort(svet,k,sizeof(struct slide), comp);
		
		if (svet[0].np>1) printf("none");
		else {
			while (k>0) {
				if (svet[0].np==1) {
					ind = cercap();
					output[svet[0].letter-'A'] = ind+1;
					elimina(ind);
					if (k>1) shift();
					k--;
					if (k>1) qsort(svet,k,sizeof(struct slide),comp);
				}
				else break;
			}
			for(i=0; i<n; i++)
				if (output[i]!=100) printf("(%c,%d) ",i+'A',output[i]);
		}
		printf("\n\n");
	}
}