There are n≥2n \ge 2n≥2 people, each holding one chocolate. In one move, a person gives one of their chocolates to another person.
What is the minimum number of moves needed so that nobody has exactly one chocolate?
You can write formulas in LaTeX or in plain text, and write your solution in any language.