#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_BUFFER 2048
int inside(int a,int b,int x) 
{

  return ((a < x) && (x < b)) ? 1:0;
}

struct slide
{
  int x1, x2, y1, y2, number;
};

int main()
{
  FILE *fin;
  char buffer[MAX_BUFFER], b2[MAX_BUFFER], *p1, *p2, *p3;
  int i, j, k, l, N, q, x, y, nx[50], ny[50], nq[50], SEQ=1, none = 0, nn, zmena;
  char c, c1, c2;

  struct slide sl[50], *sq;

  fin = fopen("slides.in", "r");
again:
  fscanf(fin, "%d", &N);
  if (!N) return 0;

  for(i = 0; i<N; i++)
  {
    fscanf(fin, "%d %d %d %d", &(sl[i].x1), &(sl[i].x2),&(sl[i].y1),&(sl[i].y2));
    sl[i].number = 0;
  }

  for(i = 0; i < N; i++)
  {
    fscanf(fin, "%d %d", &(nx[i]), &(ny[i]));
    nq[i] = 0;
  }

  nn = 0; zmena = 0;

loop:

  for(j = 0; j < N; j++)
  {
    int qq = 0;
    q = 0;

    for(i = 0; i < N; i++)
    {
      x = nx[i]; y = ny[i];
     if (inside(sl[j].x1, sl[j].x2, x) && inside(sl[j].y1, sl[j].y2, y) && (sl[j].number == 0) && (!nq[i]))
     {
       q++; qq = i;
     } 
    }

    if (q == 1) 
    {
       sl[j].number = qq + 1;
       nq[qq] = 1; nn++; zmena = 1;
    }
  }



  for(i = 0 ;i<N; i++ )
  {
    x = nx[i]; y = ny[i];
    sq = NULL; q = 0;
   /* najdi slides */ 
   for(j = 0; j < N; j++)
   {
     if (inside(sl[j].x1, sl[j].x2, x) && inside(sl[j].y1, sl[j].y2, y) && (sl[j].number == 0) && (!nq[i]))
     {
       sq = &sl[j];
       q++;
     }
   }
   if (q == 1)
   {
     sq->number = i + 1; nn++; zmena = 1;
     nq[i] = 1;
   }
  }

  if ((nn < N) && zmena) { zmena = 0; goto loop;}

  printf("Heap %d\n", SEQ++);
  if (nn == 0) 
   printf("none\n\n");
  else
  {
    for(i = 0; i < N; i++)
    {
      if (sl[i].number)
        printf("(%c,%d) ", i + 'A', sl[i].number);
    }
    printf("\n\n");
  }
goto again;

  return 0;
}