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: Can a computer be programmed entirely in Boolean algebra?, Answer:Yes, Description of Boolean algebra: Algebra involving variables containing only "true" and "false" (or 1 and 0) as values, Fact1: Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. , Fact2: Mathematics in 1 and 0 is also called binary or machine language., Fact3: Computers are programmed in machine language.

Ex Output:
Step1: What are values included in Boolean algebra?, Step2: At what level are program codes read directly by computers?, Step3: Are the values included in #2 the same as #1?, Wikipedia page for step 1: Boolean algebra, Wikipedia page for step 2: Computer programming, Wikipedia page for step 3: , not_definitive_answer: False, incorrect_answer: False


Ex Input:
Question: Would someone with a nosebleed benefit from Coca?, Answer:Yes, Description of Coca: group of plant varieties cultivated for coca production, Fact1: Coca constricts blood vessels., Fact2: As a result, it serves to stop bleeding. , Fact3: Someone with a nosebleed would want the bleeding to stop.

Ex Output:
Step1: What does Coca do to blood vessels?, Step2: What happens to blood when #1 occurs?, Step3: Would someone with a nose want #2 to occur?, Wikipedia page for step 1: Coca, Wikipedia page for step 2: Blood Vessels, Wikipedia page for step 3: Nosebleed, not_definitive_answer: False, incorrect_answer: False


Ex Input:
Question: Would ancient handball players have an advantage at a modern concert?, Answer:Yes, Description of Handball: Olympic team sport played by 7 players a side on an indoor court, Fact1: In Ancient Greece, one player sat on the other's shoulder to play handball., Fact2: Sitting on another person's shoulder is a common tactic to get a better view at modern concerts.

Ex Output:

Step1: How did players play handball in Ancient Greece?, Step2: Would a setup just like #1 get you a better view at a modern day concert?, Wikipedia page for step 1: Ancient Greece, Wikipedia page for step 2: , not_definitive_answer: False, incorrect_answer: False