public static int SolveProblem2()
{
int previousValue = 1;
int currentValue = 1;
int fibonacciSum = 0;

while (currentValue < 4000000)
{
int newValue = previousValue + currentValue;
previousValue = currentValue;
currentValue = newValue;

if (newValue % 2 == 0)
{
fibonacciSum += newValue;
}
}
return fibonacciSum;
}