The Riemann Hypothesis

The Riemann Hypothesis, concerning the distribution of zeros of the Riemann zeta function, was proposed by Bernhard Riemann in 1859. Although no definitive pattern has been found for the distribution of prime numbers among natural numbers, Riemann discovered that the number of prime numbers not exceeding $x$, represented by the prime number distribution function $\pi (x)$, can be expressed through the distribution of the so-called "non-trivial zeros" of the zeta function. The Riemann zeta function $\zeta (s)$ is defined for all complex s \ne 1 and has zeros at negative even integers s = -2, -4, -6, \ldots

From the functional equation and explicit expression for \operatorname{Re}s > 1, where $\mu (n)$ is the Möbius function, it follows that all other zeros, called "non-trivial", are located within the strip 0 \le \operatorname{Re}s \le 1, symmetrically about the "critical line" \frac{1}{2} + it, where $t$ is a real number. The Möbius function is closely linked to Euler's totient function $\phi (n)$, which counts the natural numbers up to $n$ that are coprime with $n$. Therefore, to effectively search for "non-trivial" zeros over large intervals, it is necessary to quickly find local extrema of the following sum.

You are given an interval of natural numbers $[L,R]$. Your task is to find a natural number $x$ such that

If there are multiple such numbers, output the smallest one.