UVA, 11000 Bee

In Africa there is a very special species of bee. Every year, the female bees of such species give birthto one male bee, while the male bees give birth to one male bee and one female bee, and then they die!

Now scientists have accidentally found one “magical female bee” of such special species to the effectthat she is immortal, but still able to give birth once a year as all the other female bees. The scientistswould like to know how many bees there will be after N years. Please write a program that helps themfind the number of male bees and the total number of all bees after N years.

Input

Each line of input contains an integer N (≥ 0).Input ends with a case where N = −1. (This caseshould NOT be processed.)

Output

Each line of output should have two numbers, the first one being the number of male bees after Nyears, and the second one being the total number of bees after N years. (The two numbers will notexceed 232.)

Sample Input

1

3

-1

Sample Output

1 

24

7

简单来说就是有一种特殊的蜜蜂，每年一只雌蜂会生出一只雄峰，而一只雄峰会生出一只雌蜂和一只雄蜂，然后他们会死去。而有一只特殊的雌蜂生了雄蜂之后不会死。要求N年之后雄蜂的数量和蜜蜂总数。

分析如下，一开始有一只特殊的雌蜂

N m f

0 1(不死)

1 1 1

2 2 2

3 4 3

总结来说 当年的雄蜂数量=上一年雄蜂数量+上一年雌蜂数量

当年雌蜂数量=上一年雄蜂数量+1

代码如下

#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
    long long N;
    while(cin>>N && N!=-1) {
        long long m=0,f=1,a,b;
	for(long long i=1; i<=N; i++){
            a=m;
            m+=f;
            f=a+1;
	}
        cout<<m<<" "<<m+f<<endl;
    }
      return 0;
}