hdu 2516 FIB博弈模型

LL fib[60] ;
void init(){
    int i;
    fib[0] = fib[1] = 1 ;
    for( i=2 ;i < 55; i++){
        fib[i] = fib[i-1] + fib[i - 2] ;
    }
}
int main()
{
    init() ;
    int n , i;
    while(scanf("%d" , &n) && n){
        for(i = 2 ; i < 55 ; i++)
            if(fib[i] == n)
                break;
        if(i != 55)
            printf("Second win\n") ;
        else puts("First win") ;
    }
}