Four 4-byte entries, one of which is chosen at random by 970B: the word that answers the riddle, and the address of the riddle. There are only two riddles, each stored twice, so they are equally likely. The code for the hidden routes (970B) counts its entries from C6F7, so the last riddle entry also serves as that table's never-used entry 0.