First, start by reading the problem statement for Doublets. The input format is the same.

Like Doublets, the input consists of a dictionary of words, one per line, followed by pairs of words, one per line. The dictionary and word pairs are separated by an empty line.

Print the number of words in the dictionary, in the format below. For each line of input words, print the words “yes” or “no” (separated by a space) indicating if the corresponding word is in the dictionary or not. Separate each case by a blank line (there is no blank line before the first case or after the last case).

NEXT TIME: The number of words in the dictionary should be the number of *unique* words.

booster
rooster
roaster
coasted
roasted
coastal
postal

booster roasted
coastal postal
rooster fooster

Dictionary size: 7 words
yes yes

yes yes

yes no