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?
One number n (1≤n≤90).
Print one number — the answer to the problem.