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.

Input: Consider 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.

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


Input: Consider Input: Question: Does the word swastika have meaning in sanskrit?, Answer:Yes, Description of Swastika: a geometrical figure and an ancient religious icon in the cultures of Eurasia and 20th-century symbol of Nazism, Fact1: In Sanskrit, the word swastika is a combination of ‘su’ (meaning ‘good’) and ‘asti’ (meaning ‘to exist’), Fact2: This meaning of swastika  from Sanskrit this gets translated as ‘all is well.’ 

Output: Step1: Was the word swastika derived from a Sanskrit word?, Wikipedia page for step 1: Swastika, not_definitive_answer: False, incorrect_answer: False


Input: Consider Input: Question: Would the Titanic be well preserved at the bottom of the Gulf of Finland?, Answer:Yes, Description of Gulf of Finland: arm of the Baltic Sea, Fact1: The bottom of the gulf is one of the world's largest ship cemeteries. Because of the low salinity and cold waters, and no shipworms, the ships are relatively well preserved., Fact2: RMS Titanic was a British passenger ship.


Output: Step1: Are ships well-preserved in the Gulf of Finland?, Step2: Was the RMS Titanic a ship?, Step3: Is both #1 and #2 "yes", Wikipedia page for step 1: Gulf of Finland, Wikipedia page for step 2: Titanic, Wikipedia page for step 3: , not_definitive_answer: False, incorrect_answer: False