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

def gets_fibo():

    value1 = 0 #initalize value 1
    value2 = 1 #initalize value2 
    total = 0 #the answer
    valueTemp = 0
    while value2<= 4000000: #while value is less than four million
        if value2 % 2 == 0: #if value is even
            total += value2 # only then we add it to the answer
        valueTemp = value1
        value1 = value2 #
        value2 += valueTemp 
        #print (value,value2)
    print (total)
gets_fibo()
