The input consists of several scenarios. The first input line contains a number 11000 indicating how many scenarios there are.
Each scenario starts with a line with a number 1-2000 telling how many fact lines there are for that scenario. Then follow the fact lines which each contains three words separated by one or more spaces:
The first and third word is one of these names:
1 2 3 4 5
blue green red white yellow
anna bernhard chris david ellen
danish finnish icelandic norwegian swedish
amiga atari linux mac windows
c c++ java pascal perl
(Note that no uppercase letters are used.)
The second word specifies a relationship; it is one of
same-as left-of right-of next-to
same-as tells that the first and third fact words apply to the same room; for instance
blue same-as bernhard
tells that Bernhard lives in the room with a blue door.
left-of tells that the first fact word applies to the room immediately to the left of the one to which the third fact word applies. For example,
chris left-of perl
means that Chris lives in the room immediately to the left of the Perl programmer.
right-of tells that the first fact word applies to the room immediately to the right of the one to which the third fact word applies.
next-to tells that the two fact words apply to rooms next to each other. For example,
swedish next-to linux
means that the Swedish student lives in the next room (either to the left or the right) of the owner of the Linux computer.
You may assume that there are no inconsistencies in the input data. In other words, there will in every scenario be at least one person who may own the Amiga without violating the constraints.