Fix "retry" algorithm from b4n MR which is not exactly the same as "every"
"every" is a loop, meaning that it always has to rotate back to the begining when the threshold is met. But retry is more like a ceiling, menaning that after the threshold it is "too much". So modulo is perfect for "every" and for "retry", use min().
Showing with 3 additions and 2 deletions