Max And Operations

For an array $B$ of length $N$, we define $f(B)$ as follows. Consider the following process: - Initially, you have a **bag** containing the elements $B_1, B_2, \dots, B_N$. A bag treated as a multiset, meaning it may contain duplicate values. Your score is initially $0$. - $N-1$ times, perform the following operation: - Choose and remove two elements $X$ and $Y$ from the bag. - Add $\ma