>There’s a classic logic puzzle in which a person must take a fork in the road, one of which is safe, but the other is a deadly trap. Two men guard the fork, one of which always lies, but the other always tells the truth. The person gets to ask one question in order to determine which path is the safe one.
>
>Mathematician Raymond Smullyan has added another dimension to this puzzle. See if you can figure it out:
>
>There are three guardians, A, B and C. Their names are Knight, Knave and Chaos. Knight always speaks truly, Knave always lies. Chaos tossed a coin this morning to decide whether today he would behave like Knight or like Knave.
>
>Your task is simple: ask three yes-no questions, each of a single guardian, and determine which is Knight, which is Knave, and which is Chaos. There is, alas, a complication: the guardians understand English but will answer in the local language, in which “Da” means yes and “Ja” means no. Or possibly “Ja” means yes and “Da” means no – you cannot remember.

Q1: are you capable of understanding simple "yes" and "no"?

("Da" is "yes" in most Slavic languages except Polish and maybe one more; "Ja" is "yes" in German... so we have two yesses and are a bit short on nos)