In this task you will be given a text passage from a trivia quiz. You should choose the category this question belongs to from these categories: History, Science, Social Science, Fine Arts, Literature. You can only choose one category, so if in doubt, please choose the closest match.

Example Input: In later life this mythological figure left Argos and arrived after some journeys in southern Italy, where he supposedly founded several cities. The son of Tydeus and Deipyle, this man was one of the Epigoni before going to Troy, where he nearly killed Aeneas in combat, killed both Rhesus and Dolon, helped smuggle the Palladium out of Troy, and even managed to wound the god Ares in battle. Name this character of Greek myth who shares his name with a king of Thrace known, FTP, for his flesh-eating mares, to whom he fed the bodies of his houseguests until he himself was fed to them by Heracles.
Example Output: Social Science

Example Input: In a 1984 study, J.G. Miller showed that this was less common among Indian Hindus than Americans. The common term for it was first coined in the work "The Intuitive Psychologist and His Shortcomings", while studies by Daniel Gilbert have shown it to be more common when cognitive load is high. Lee Ross coined the term for it in 1977, while Edward Jones and Victor Harris demonstrated it in a famous 1967 experiment in which subjects read essays and were then asked to rate the authors attitudes toward Fidel Castro. Also called the "correspondence bias," FTP, name this psychological tendency to over-emphasize personality attributes and under-emphasize situational attributes in explaining the behavior of others.
Example Output: Social Science

Example Input: The first solution to a nontrivial instance of this problem was presented by Dantzig, Fulkerson, and Johnson in 1954 and employed linear programming technqiues to provide a solution for a graph of 42 nodes. An optimal solution to the "Sweden" instance of this problem, the largest one so far solved, was generated by the (*) Lin-Kernighan heuristic. Formally stated, the problem is to find the Hamiltonian cycle for a weighted graph with the minimum edge cost. For 10 points, identify this NP-hard problem in computer science, based on the task of visiting every city in a territory and returning to the start while driving a minimum distance.
Example Output:
Science