CMO 2020 Problem 1

Let $S$ be a set of $n \geq 3$ positive real numbers. Show that the largest possible number of distinct integer powers of three that can be written as the sum of three distinct elements of $S$ is $n-2$.