문제<\/h2>
There are unicorns living in a magical kingdom on a plane. People know the coordinates of $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> points on the map: the places of unicorn sightings.<\/p> Recently, the king agreed to declare the territory inhabited by unicorns a nature reserve. The boundaries of the reserve should be two parallel lines that will contain all n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> places of unicorn sightings between them (or on them). However, land in the kingdom is expensive, so the king does not want to allocate anything extra for the reserve: each boundary must pass through at least one of the n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> points.<\/p> You are the chief ecologist of the kingdom. Your task is to choose the boundaries of the reserve so that the king's will is fulfilled, but the reserve is as large as possible. The size of the reserve is defined as the distance between the boundaries.<\/p> 입력<\/h2> The first line contains an integer n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span>: the number of places unicorn sightings (2<\/mn>\leq<\/mo>n<\/mi>\leq<\/mo>1000<\/mn><\/mrow>2 \le n \le 1000<\/math><\/span><\/span> 2<\/span> <\/span>$

Nature Reserve