Out of the line!#5973
soldiers stand in one line. In how many ways can we choose some of them (at least one) so that among them there will be no two soldiers standing beside each other?
One number n~(1 \le n \le 90).
Print one number — the answer to the problem.
Example 1
Example 2
Example 3