Out of the line!

$n$ soldiers stay in one line. In how many ways can we choose some of them (at least one) so that among them there will not be soldiers standing beside?

Input

One number $n(1\le n\le 90)$.

Output

Print one number — the answer to the problem.

Examples