Prove the following theorem:

Every positive integer can be represented uniquely as the sum of one or more distinct Fibonacci numbers without including any two consecutive Fibonacci numbers.

Examples: 8=8; 27=21+5+1