===== Prelude to Doublets ======

First, start by reading the problem statement for [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=31&page=show_problem&problem=1091|Doublets]].  The input format is the same.

===== Input =====

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.

===== Output =====

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.

===== Sample Input =====

<code>
booster
rooster
roaster
coasted
roasted
coastal
postal

booster roasted
coastal postal
rooster fooster
</code>

===== Sample Output =====

<code>
Dictionary size: 7 words
yes yes

yes yes

yes no
</code>