Mesmerization of The Count

"Sesame Street's" The Count has developed a new obsession. He has left the busy New York streets where he gained his fame and now roams Oregon, popping up unexpectedly and challenging unwary programmers throughout the state with perplexing mathematical puzzles. Only one way has proven effective to distract him: he is mesmerized by equations of the form

for natural numbers $a$, $b$, $c$, and $n$. For instance,

kept him occupied for a good $20$ minutes, giving mathematician Henry Dudeney enough time to escape The Count's barrage of questions. Unfortunately, large numbers like this are too hard to memorize, so shorter ones such as

are better. Each such equation only works once to mesmerize him, so your job is to write a program that will generate new such equations. In particular, you will be given $n$, and your job is to generate values for the natural numbers $a$, $b$, $c$ that satisfy the first equation. When multiple solutions exist, you should report the one with the minimum possible sum a + b + c + b, such that the value of $a/b$ is greater than or equal to the value of $c/b$. You may assume such a solution is unique. If you cannot find three natural numbers $a$, $b$, $c$ such that a + b + c + b is less than $4000$, you should print "No value.".