Project Euler Problem #2

Here is my attempt at the second problem, I got it right first shot, but again I think the way I used the while loop and if statement is not very elegant. If i make any revisions I'll update. Until till then, here:

Problem 2: 
"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, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms."

Code:

//Fibonacci Problem 2

int[] nums = new int[3];

int total = 2;

nums[0] = 1;

nums[1] = 2;

while (nums[2] < 4000000) {

if (nums[2]%2 == 0) {

total += nums[2];

}

nums[2] = nums[0] + nums[1];

nums[0] = nums[1];

nums[1] = nums[2];

}

text(total,0,50);