In the following task, you are given a yes/no question, its answer, and additional information which includes a description of a key term in the question and several facts. Your task is to "decompose the question"i.e. write the steps required to construct the given answer where each step is a question that can be answered using Wikipedia articles. To decompose the question, think of a decomposition strategy you could apply to answer the question through a search against Wikipedia. The decomposition strategy might not be obvious for some questions. For this reason, you are provided with additional information. You are not required to write decompositions that exactly match the provided facts, they are only meant as guidance. If the facts are too noisy, think about how you would have used Wikipedia to answer this question to create the decomposition. "not_definitive_answer" is true if there is no clear answer i.e. the question is ambiguous or a subjective opinion."incorrect_answer" is true if the answer to the question is not correct. If the answer is incorrect, write a decomposition that evaluates the correct answer. Each question should be easy to answer based on simple facts from Wikipedia pages, or a simple check using the answers to preceding questions. To ensure this, we also ask you to enter a potential Wikipedia article that would contain the answer to each question. If you can not think of a Wikipedia page that can answer your question, please think of a different strategy. You do not need to enter a Wikipedia page for steps that don't add new information and only contain simple checks. The answer to the final question is the same as the answer to the original question. Every question's answer has an impact on the final answer and there should be no redundant steps in the decomposition.

Ex Input:
Question: After viewing the Mona Lisa, could you get lunch nearby on foot?, Answer:Yes, Description of Mona Lisa: Painting by Leonardo da Vinci, Fact1: The Mona Lisa is housed in The Louvre., Fact2: There are many restaurants within walking distance of The Louvre.

Ex Output:
Step1: Where is the Mona Lisa located?, Step2: Is #1 a place likely to have at least a restaurant/hotel nearby?, Wikipedia page for step 1: Mona Lisa, Wikipedia page for step 2: Louvre, not_definitive_answer: True, incorrect_answer: False


Ex Input:
Question: Is Hamilton too long to watch while Thanksgiving dinner cooks?, Answer:No, Description of Thanksgiving (United States): holiday celebrated in the United States on the fourth Thursday in November, Fact1: Hamilton's runtime is two hours and forty minutes., Fact2: Most people eat turkey on Thanksgiving., Fact3: Turkey takes at least three hours to cook.

Ex Output:
Step1: What is the runtime for Hamilton?, Step2: What is the main dish people eat on Thanksgiving?, Step3: How long does it take to cook #2? , Step4: IS #1 more than #3?, Wikipedia page for step 1: Hamilton, Wikipedia page for step 2: Thanksgiving, Wikipedia page for step 3: Turkey, Wikipedia page for step 4: , not_definitive_answer: False, incorrect_answer: False


Ex Input:
Question: Does coding rely on Boolean algebra characters?, Answer:Yes, Description of Boolean algebra: Algebra involving variables containing only "true" and "false" (or 1 and 0) as values, Fact1: Boolean algebra uses the characters of 1 and 0 to represent true and false., Fact2: Binary code is an essential part of computer coding., Fact3: Binary code consists of the characters 0 and 1 which represents strings of value.

Ex Output:

Step1: What characters does Boolean algebra use?, Step2: What characters does binary code use?, Step3: Are #1 and #2 the same?, Wikipedia page for step 1: Boolean algebra, Wikipedia page for step 2: Binary code, Wikipedia page for step 3: , not_definitive_answer: False, incorrect_answer: False