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: This entity shares its name with one controlled by the astronomer and investigator of mesmerism, Jean Sylvain Bailly. It saw the execution of General Lecomte, and Marshall MacMahon led a campaign against it that culminated with a mass execution at the Wall of the Federalists. Its aftermath saw a mass deportation to New Caledonia, and it was opposed by Adolphe Thiers. Louis-Auguste Blanqui was its nominal leader despite being imprisoned at the time, and it ended in the "Bloody Week" amidst fierce barricade fighting. Growing out of the Franco-Prussian War, for 10 points, name this socialist government that held power for two months in 1871 in the French capital.
Example Output: History

Example Input: This man's namesake elasticity describes surface tension resistance when a surface is stretched, and can be applied to surface-tension-related mass transfer in an effect named for this man and Marangoni. For a mixture at constant temperature and pressure, the change in the chemical potential of the system can be obtained using an equation named for this man and Duhem. Another equation named for this man is used to calculate the degrees of freedom of a system depending in part on its number of components. For 10 points, name this man with a namesake phase rule and a thermodynamic quantity useful in predicting the spontaneity of a chemical reaction, his free energy.
Example Output: 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