This task is about reading the given passage and construct a question about the information present in the passage. Construct a question in such a way that (i) it is unambiguous, (ii) it is answerable from the passage, (iii) its answer is unique (iv) its answer is a continuous text span from the paragraph. Avoid creating questions that (i) can be answered correctly without actually understanding the paragraph and (ii) uses same words or phrases given in the passage.

Example Input: Southeast Raleigh is bounded by downtown on the west, Garner on the southwest, and rural Wake County to the southeast. The area includes areas along Rock Quarry Road, Poole Road, and New Bern Avenue. Primary neighborhoods include Chastain, Chavis Heights, Raleigh Country Club, Southgate, Kingwood Forest, Rochester Heights, Emerald Village and Biltmore Hills. Time Warner Cable Music Pavilion (formerly Alltel Pavilion and Walnut Creek Amphitheatre) is one of the region's major outdoor concert venues and is located on Rock Quarry Road. Shaw University is located in this part of the city.
Example Output: What is to the west of Southeast Raleigh?

Example Input: Hans Bielenstein writes that as far back as the Han dynasty (202 BCE–220 CE), the Han Chinese government "maintained the fiction" that the foreign officials administering the various "Dependent States" and oasis city-states of the Western Regions (composed of the Tarim Basin and oasis of Turpan) were true Han representatives due to the Han government's conferral of Chinese seals and seal cords to them.
Example Output: What was the western regions composed of?

Example Input: The most basic method of checking the primality of a given integer n is called trial division. This routine consists of dividing n by each integer m that is greater than 1 and less than or equal to the square root of n. If the result of any of these divisions is an integer, then n is not a prime, otherwise it is a prime. Indeed, if  is composite (with a and b ≠ 1) then one of the factors a or b is necessarily at most . For example, for , the trial divisions are by m = 2, 3, 4, 5, and 6. None of these numbers divides 37, so 37 is prime. This routine can be implemented more efficiently if a complete list of primes up to  is known—then trial divisions need to be checked only for those m that are prime. For example, to check the primality of 37, only three divisions are necessary (m = 2, 3, and 5), given that 4 and 6 are composite.
Example Output:
What is the most elemental way to test the primality of any integer n?