{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003ch2\u003eProblem K\n\u003c/h2\u003e\n\n\u003cp\u003e\nAlice and Bob are playing the following game. Initially, $n$ stones are placed in a straight line on a table. Alice and Bob take turns alternately. In each turn, the player picks one of the stones and removes it. The game continues until the number of stones on the straight line becomes two. The two stones are called \u003ci\u003eresult stones\u003c/i\u003e. Alice\u0027s objective is to make the result stones as distant as possible, while Bob\u0027s is to make them closer.\n\u003c/p\u003e\n\n\u003cp\u003e\nYou are given the coordinates of the stones and the player\u0027s name who takes the first turn. Assuming that both Alice and Bob do their best, compute and output the distance between the result stones at the end of the game.\n\u003c/p\u003e\n\n\n\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\n\u003cp\u003e\nThe input consists of a single test case with the following format.\u003cbr\u003e\n\u003cbr\u003e\n\n$n$ $f$\u003cbr\u003e\n$x_1$ $x_2$ ... $x_n$\u003cbr\u003e\n\u003cbr\u003e\n\n$n$ is the number of stones $(3 \\leq n \\leq 10^5)$. $f$ is the name of the first player, either Alice or Bob. For each $i$, $x_i$ is an integer that represents the distance of the $i$-th stone from the edge of the table. It is guaranteed that $0 \\leq x_1 \u0026lt; x_2 \u0026lt; ... \u0026lt; x_n \\leq 10^9$ holds.\n\u003c/p\u003e\n\n\n\u003ch3\u003eOutput\u003c/h3\u003e\n\n\u003cp\u003e\nOutput the distance between the result stones in one line.\n\u003c/p\u003e\n\n\n\u003ch3\u003eSample Input 1\u003c/h3\u003e\n\n\u003cpre\u003e5 Alice\n10 20 30 40 50\u003c/pre\u003e\n\n\u003ch3\u003eSample Output 1\u003c/h3\u003e\n\n\u003cpre\u003e30\u003c/pre\u003e\n\n\n\n\u003ch3\u003eSample Input 2\u003c/h3\u003e\n\n\u003cpre\u003e5 Bob\n2 3 5 7 11\u003c/pre\u003e\n\n\u003ch3\u003eSample Output 2\u003c/h3\u003e\n\n\u003cpre\u003e2\u003c/pre\u003e\n\n"}}]}