Min And Operations

You are given a set $S$ containing exactly $N+1$ numbers: $S = \{0,1,2,\dots,N\}$ (each value appearing exactly once). **It is guaranteed that $N$ is even.** Initially, your score is $0$. You must perform operations as long as $S$ has at least two elements remaining in it. In each operation: - Choose and remove two **distinct** elements $X$ and $Y$ from the set. - Add $\max(X,Y)$ to your sco