Project Euler Problem 2

Today I got some time to look at Euler Problem 2.

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, ...

Find the sum of all the even-valued terms in the sequence which do not exceed four million.

The solution is to run a loop to find the next term in Fibonacci series. Check the evenness of the term and add to the sum.

public class ProblemTwo {
    public static void main(String[] args) {
        int firstTerm = 0;
        int secondTerm = 1;
        int newTerm = 0;
        int sum = 0;

        while (secondTerm <= 4000000) {
            newTerm = firstTerm + secondTerm;

            if (0 == (newTerm % 2)) {
                sum += newTerm;
            }

            firstTerm = secondTerm;
            secondTerm = newTerm;
        }

        System.out.print(sum);
    }
}