12.4.8 Various Olympiad problems

Problem: A regular 85-gon is inscribed in a circle, at the vertices of which different natural numbers are written. A pair of non-neighboring vertices of a polygon \( A \) and \( B \) is called interesting if at least on one of the two arcs of \( A B \) at all vertices of the arc there are numbers greater than the numbers, written at vertices \( A \) and \( B \). What is the least number of interesting pairs of vertices that this polygon can have?