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

#define D 0

int i;
int cnt=0;

int daten[2000];


void tutuj(int * pos, int w) {
  int i;
  for (i = 0; i<6; i++) pos[i] = w;
}


int off(int * pos) {
  int i, r = 0, f = 1;
  for (i=0; i<6; i++)
    {
      r += f*pos[i];
      f *= 3;
    }
  return r;
}


void set(int * pos, int wert) {
  int p = off(pos);
  daten[p] = wert;
}

int get(int * pos) {
  return daten[off(pos)];
}


void block(int * pos, int www) {
  int pp[6];

    if (D) cout<< "pos = " << pos[0] << pos[1] << pos[2]
		 << pos[3] << pos[4] << pos[5]<<"\n";
  

  for (pp[0] = (pos[0]==-1 ? 0 : pos[0]); pp[0] <= (pos[0]==-1 ? 2 : pos[0]);
       (pp[0])++)
  for (pp[1] = (pos[1]==-1 ? 0 : pos[1]); pp[1] <= (pos[1]==-1 ? 2 : pos[1]);
       (pp[1])++)
  for (pp[2] = (pos[2]==-1 ? 0 : pos[2]); pp[2] <= (pos[2]==-1 ? 2 : pos[2]);
       (pp[2])++)
  for (pp[3] = (pos[3]==-1 ? 0 : pos[3]); pp[3] <= (pos[3]==-1 ? 2 : pos[3]);
       (pp[3])++)
  for (pp[4] = (pos[4]==-1 ? 0 : pos[4]); pp[4] <= (pos[4]==-1 ? 2 : pos[4]);
       (pp[4])++)
  for (pp[5] = (pos[5]==-1 ? 0 : pos[5]); pp[5] <= (pos[5]==-1 ? 1 : pos[5]);
       (pp[5])++)
    {if (D&&0) cout << pos[0] << pos[1] << pos[2]
		 << pos[3] << pos[4] << pos[5]<<"\n";
      set(pp, 0);
      if (D)
	if (pp[0] == 0 && pp[1] == 2) cout << "***" << www << "\n";
    }
}

int tstblock(int * pos) {
  int pp[6];


  for (pp[0] = (pos[0]==-1 ? 0 : pos[0]); pp[0] <= (pos[0]==-1 ? 2 : pos[0]);
       pp[0]++)
  for (pp[1] = (pos[1]==-1 ? 0 : pos[1]); pp[1] <= (pos[1]==-1 ? 2 : pos[1]);
       pp[1]++)
  for (pp[2] = (pos[2]==-1 ? 0 : pos[2]); pp[2] <= (pos[2]==-1 ? 2 : pos[2]);
       pp[2]++)
  for (pp[3] = (pos[3]==-1 ? 0 : pos[3]); pp[3] <= (pos[3]==-1 ? 2 : pos[3]);
       pp[3]++)
  for (pp[4] = (pos[4]==-1 ? 0 : pos[4]); pp[4] <= (pos[4]==-1 ? 2 : pos[4]);
       pp[4]++)
  for (pp[5] = (pos[5]==-1 ? 0 : pos[5]); pp[5] <= (pos[5]==-1 ? 1 : pos[5]);
       pp[5]++)
    if (get(pp)) return 1;

  return 0;
}


int z;

char wer, bez[9], aus[22];
int weri, bezi, ausi;
int neg;
int k[6];


int main() {

  FILE *in = fopen("island.in","r");

  while (1) {

    fscanf(in, "%d\n", &z);
    if (!z) exit(6*9==42);

    for (i=0; i<2000; i++) daten[i]=1;

    for (i=0; i<z; i++) {

      fscanf(in, "%c: %s", &wer, bez);

      if (D) cout << wer << " " << bez << "\n";

      weri = wer - 'A';
      if (bez[1] == 't') {
       
	// Tag / Nacht

	fscanf(in, "%*s %s", aus);

	int tn = !strcmp(aus, "day");

	if (D) cout << tn << "\n";

	tutuj(k, -1);
	k[5] = !tn;
	k[weri] = 2;
	block(k, 0);
	
	tutuj(k, -1);
	k[5] = tn;
	k[weri] = 0;
	block(k, 1);

	if (!tn) {
	  tutuj(k, -1);
	  k[weri] = 1;
	  block(k, 2);
	}
	

      } else {

	// X ist ...

	if (bez[0]=='I') bezi = weri; else bezi = bez[0] - 'A';

	if (D) cout << weri << " " << bezi << "\n";

	fscanf(in, "%*s%s", aus);
	neg = 0;
	if (!strcmp(aus, "not")) {
	  neg = 1;
	  fscanf(in, "%s", aus);
	}

	if (aus[0] == 'e') ausi = 0;
	if (aus[0] == 'h') ausi = 1;
	if (aus[0] == 'd') ausi = 2;
	if (aus[0] == 'l') ausi = 3;
	
	if (D) cout << aus << " " << ausi << "\n";


	if (weri == bezi) {
	  // Selbstbez.

	  if (!neg) {

	    if (ausi == 3) { // Ich luege.
	      tutuj(k, -1);
	      block(k, 3);
	    }
	    else if (ausi == 2) {  // divine
	      if (D) cout <<"!\n";
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 1;
	      block(k, 4);
	      if (D) cout <<"?\n";
	    }
	    else if (ausi == 1) {  // human
	      tutuj(k, -1);
	      k[weri] = 2;
	      block(k, 5);
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 0;
	      block(k, 6);
	    }
	    else if (ausi == 0) {  // evil
	      tutuj(k, -1);
	      k[weri] = 0;
	      block(k, 7);
	      tutuj(k, -1);
	      k[weri] = 2;
	      block(k, 8);
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 1;
	      block(k, 9);
	    }
	    // ende !neg
	  } else {

	    if (ausi == 3) { // ich luege nicht

	    }
	    else if (ausi == 2) { // nicht div
	      tutuj(k, -1);
	      k[weri] = 0;
	      block(k, 10);
	      tutuj(k, -1);
	      k[weri] = 2;
	      block(k, 11);
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 0;
	      block(k, 12);
	    }
	    else if (ausi == 1) { // nicht hum
	      tutuj(k, -1);
	      k[weri] = 0;
	      block(k, 13);
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 1;
	      block(k, 14);
	    }
	    else if (ausi == 0) { // nicht evi
	      tutuj(k, -1);
	      k[weri] = 1;
	      k[5] = 0;
	      block(k, 15);
	    }
	    

	  }  // ende neg


	} else {
	  // Fremdbez.

	  int xgut = neg ? 0 : 2;
	  int xtag = neg ? 0 : 1;

	  if (ausi == 3) { // er luegt
	    // Aussage richtig
	    tutuj(k, -1);
	    k[weri] = xgut;
	    k[bezi] = 2;
	    block(k, 16);
	    tutuj(k, -1);
	    k[weri] = xgut;
	    k[bezi] = 1;
	    k[5] = 1;
	    block(k, 17);
	    tutuj(k, -1);
	    k[weri] = 1;
	    k[5] = xtag;
	    k[bezi] = 2;
	    block(k, 18);
	    k[weri] = 1;
	    if (xtag == 1) {
	      tutuj(k, -1);
	      k[bezi] = 1;
	      k[5] = 1;
	      block(k, 19);
	    }
	    // Aussage falsch
	    tutuj(k, -1);
	    k[weri] = 2 - xgut;
	    k[bezi] = 0;
	    block(k, 20);
	    tutuj(k, -1);
	    k[weri] = 2 - xgut;
	    k[bezi] = 1;
	    k[5] = 0;
	    block(k, 21);
	    tutuj(k, -1);
	    k[weri] = 1;
	    k[5] = 1 - xtag;
	    k[bezi] = 0;
	    block(k, 22);
	    k[weri] = 1;
	    if (xtag == 1) {
	      tutuj(k, -1);
	      k[bezi] = 1;
	      k[5] = 0;
	      block(k, 23);
	    }
	    
	  }
	  else { // er ist ...
	    // Aussage richtig:
	    tutuj(k, -1);
	    k[bezi] = (ausi + 1) % 3;
	    k[weri] = xgut;
	    if (D) cout << weri << " " 
			<<  bezi << " " << ausi << " " << xgut << "\n";
	    block(k, 24);
	    tutuj(k, -1);
	    k[bezi] = (ausi + 2) % 3;
	    k[weri] = xgut;
	    block(k, 25);
	    tutuj(k, -1);
	    k[bezi] = (ausi + 1) % 3;
	    k[weri] = 1;
	    k[5] = xtag;
	    block(k, 26);
	    tutuj(k, -1);
	    k[bezi] = (ausi + 2) % 3;
	    k[weri] = 1;
	    k[5] = xtag;
	    block(k, 27);
	    // Aussage falsch:
	    tutuj(k, -1);
	    k[bezi] = ausi;
	    k[weri] = 2 - xgut;
	    block(k, 28);
	    tutuj(k, -1);
	    k[bezi] = ausi;
	    k[weri] = 1;
	    k[5] = 1 - xtag;
	    block(k, 29);

	  }



	}

	
      }  // Ende von if x ist

      if (D) cout << "bluc";

      fscanf(in, "%*[^\n]");
      fscanf(in, "\n");

      if (D) cout << "bluc\n";

    }// for i



    // Ausgabe:

    cout << "Conversation #" << ++cnt << "\n";

    int imp = 1;
    for (i = 0; i < 3*3*3*3*3*2; i++)
      if (daten[i]) imp = 0;

    if (imp) {
      cout << "This is impossible.\n\n";
    } else {
      
      int facts = 0;
      int em, hm, dm;
      for (i = 0; i < 5; i++) {
	
	tutuj(k, -1);
	k[i] = 0;
	em = tstblock(k);
	
	tutuj(k, -1);
	k[i] = 1;
	hm = tstblock(k);
	
	tutuj(k, -1);
	k[i] = 2;
	dm = tstblock(k);

	if (!em && !hm) {cout << (char) (i+'A') << " is divine.\n"; facts=1;}
	if (!dm && !hm) {cout << (char) (i+'A') << " is evil.\n"; facts=1;}
	if (!em && !dm) {cout << (char) (i+'A') << " is human.\n"; facts=1;}
      }

      int tagm, nam;
     
      tutuj(k, -1);
      k[5] = 0;
      nam = tstblock(k);
      
      tutuj(k, -1);
      k[5] = 1;
      tagm = tstblock(k);
      
      if (!nam) {cout << "It is day.\n"; facts=1;}
      if (!tagm) {cout << "It is night.\n"; facts=1;}
	
      if (!facts) cout << "No facts are deducible.\n";
      cout << "\n";

    }  // Ende von nicht imp.


  } // while(1)

} // main