Fibonacci and Mod

So I want to do a challenge, which is

"What is the smallest value of x>0 such that F[x]=0 mod 2^32"
F[x] is the fibonacci sequence.

So I cooked this up.
And I got the wrong answer... any of you see anything wrong with it?

[code]#include <ttmath\ttmath.h>
#include <cmath>
#include <iostream>
#include <fstream>

using namespace std;
typedef ttmath::Big<1,2> MyBig;

void main (){

bool done = false;
int i;

MyBig fib [150];
fib [0] = 0;
fib [1] = 1;

MyBig divi = 4294967296;
MyBig rem;

for (i = 1; i <= 145; i++){
fib [i+1] = fib [i] + fib [i-1];
rem = fib [i];
rem.Mod(divi);
if( rem ==0){
cout <<"value: " << fib [i] <<endl;
cout << "Step: " << i << endl;
cout << "Divider: " << divi << endl << endl;
}

}

cin.get();
return;
}[/code]

Reply in this thread