#include <stdio.h>

int M[30][30];
int S[30][4];
int P[30][2];
int Supp[30];

int Valid[30];

int n;

FILE *fp;

int Ass[30];
int sol[30];
/*struct Ass { int A[30]; };*/

/* 1:esci */
int found;

int Try(int l) {
  int i;
  if (l == n) {
  	if(found) {
		for (i =0 ; i < n; i++)
		  if (sol[i] != Supp[i])
		    Valid[i] = 0;

		return 0;
	}
	for(i=0;i<n;++i) sol[i]=Supp[i];
	++found;
	return 0;
  }
  for(i=0;i<n;++i) {
  	if(!Ass[i] && M[l][i]) {
/*		printf("assegno %d a %c\n", i, (char)('A'+l));*/
		Supp[l] = i;
		Ass[i] = 1;
		Try(l+1);
		
/*		Supp[l] = 0;*/
		Ass[i] = 0;
	}
  }
  return 0;
}

int main(void) {
	int sys=0;
	fp = fopen("slides.in","r");

	while(fscanf(fp,"%d",&n),n) {
		int i,j;
		
		for (i=0; i <n; i ++) {
			fscanf(fp,"%d %d %d %d",&S[i][0],&S[i][1],&S[i][2],&S[i][3]);
		}
		for (i=0; i <n; i ++) {
			fscanf(fp,"%d %d",&P[i][0],&P[i][1]);
		}
		
		for (i=0; i <n; i ++)
			for (j=0; j <n; j ++)
				if (S[i][0] < P[j][0] &&
					S[i][1] > P[j][0] &&
					S[i][2] < P[j][1] &&
					S[i][3] > P[j][1])
					M[i][j] = 1;
				else
					M[i][j] = 0;
/*		for (i=0; i <n; i ++) {
			for (j=0; j <n; j ++) printf("%d ", M[i][j]);
			puts("");
		}
		puts("");
*/	 
		for(i=0;i<n;++i) { Ass[i]=0; Valid[i] = 1; }
		printf("Heap %d\n", ++sys);
		
		found = 0;
		Try(0);
		
			j=0;
			if(found) {
				for(i=0;i<n;++i) {
					if(j>0) printf(" ");
					if (Valid[i]) {
						printf("(%c,%d)", (char)('A'+i), sol[i]+1);
						++j;
					}
				}
				if (j)
					puts("\n");
			}
			if(j==0) {
				puts("none\n");
			}
	}

	return 0;
}