简单的斐波那契变形

#include<stdio.h>

int F_rabbid(int nums)
{
    if( nums == 1 )
        return 1;
    else if( nums == 2 )
        return 1;
    else
        return F_rabbid(nums - 1) + F_rabbid(nums - 2);
}

int main()
{
    int n = 0,sum = 0;
    while(scanf("%d", &n) != EOF)
    {
        printf("%d\n", F_rabbid(n));
    }
    
    
}