Chef Segment

You are given an array $A$ consisting of $N$ integers. You are allowed to **rearrange** the elements of the array in any order. A segment $[l, r]$ of the array is considered *beautiful* if, for **every** pair $(i, j)$ where $l \leq i \leq j \leq r$, either $A_i \mod A_j = 0$ or $A_j \mod A_i = 0$. Note that `mod` denotes the [modulo](https://en.wikipedia.org/wiki/Modulo) operation. The score of