Modular Circular Permutations

You are given an array $A = [A_1, A_2, \ldots, A_N]$ containing **distinct positive** integers. Let $B$ be a [permutation](https://en.wikipedia.org/wiki/Permutation) of $A$. Define the *value* of $B$ to be $$\sum_{i=1}^N (B_i \bmod{B_{i+1}})$$ where $B_{N+1}$ is treated to be $B_1$. Find the **maximum** *value* across all permutations of $A$. ### Input - The first line of input contains a sing