#include<stdio.h>
int main()
{
int i,n;
int prenum,ternum,temp;
prenum = ternum = 1;//这一代和上一代兔子
scanf("%d",&n);
for(i = 3;i <= n;i ++)
{
temp = ternum;
ternum = ternum + prenum;
prenum = temp;
}
printf("%d",ternum);
return 0;
}
//递归算法 1,1,2,3,5,8,,,,,;
//这一代加上一代 等于下一代
//原文:https://blog.csdn.net/zzuli_Acmer/article/details/77264157