Fibonacci Sequence

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

Example:
0 + 1 = 1
1 + 1 = 2
1 + 2 = 3
2 + 3 = 5
...

In order to find the sum of all the even-valued terms in the sequence which do not exceed four million, I used the following C code:

------------------------------------------------------------
#include <stdio.h>

int main(){
int n1=0;
int n2=1;
int n3=0;
int sum=0;

while(n3<4000000){
  n3 = n1+n2;
  if((n1+n2)==((n3/2)*2)){
   printf("%d \n",n3);
   sum += n3;
  }
  n1 = n2;
  n2 = n3;
}

printf("The sum of all even-valued terms in the Fibonacci sequence which
do not exceed four million is:\n\t%d\n", sum);

}

------------------------------------------------------------