Finding Prime Fibonacci Numbers

[cpluswut]

My program is suppose to output the first 8 Prime Fibonacci numbers, My output is as follows:

1 1 2 5 13 89 233 1597 4181 28657 514229

1)Why am I getting two "1"?
2)Why am I missing " 3"?

#include <iostream>
using namespace std;

bool isPrime(int number)
  {
     int i;
     for (i=2; i<number; i++)
     { if(number % i==0)
       return false;
     }
     
     return true; //will return true otherwise
  }


int fib(int n)
{
  if(1 == n || 2 == n)
  {
      return 1;
  }
  else
  {
      return fib(n-1) + fib(n-2);
  }

}

int main()
{
    for(int i=1; i<=30; i++)
    {
        if (isPrime(i) == true)
        {
        cout << fib(i) << " ";
        }
    }
    return 0;
}

[hohanyo]

i think because you check 1 first then you get "1" then you check two "1" and the first two number are one and two.

if(1 == n || 2 == n)
  {
      return 1;