


"""simple docstring"""





snake_case__		:     List[Any]    				=				'''Tobias Carryer'''

from time import time



class 		snake_case_:






     def __init__(	self  :					Optional[Any]					,				UpperCamelCase_  :					Optional[Any]					,				UpperCamelCase_  :					Tuple					,				UpperCamelCase_  :					Optional[int]					,				UpperCamelCase_  :					Dict=int(time()				)				):  # noqa: B008
           lowerCAmelCase					:	str       =   multiplier
           lowerCAmelCase					:	Optional[int]       =   increment
           lowerCAmelCase					:	Optional[Any]       =   modulo
           lowerCAmelCase					:	Optional[Any]       =   seed






     def      lowerCamelCase__     (	self  :					Union[str, Any]				):
           lowerCAmelCase					:	Optional[int]       =   (self.multiplier * self.seed + self.increment) % self.modulo
           return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 snake_case__		:     int    				=				LinearCongruentialGenerator(1_664_525, 1_013_904_223, 2 << 31)
 while True:
  print(lcg.next_number())






"""simple docstring"""





def      _snake_case						(						_snake_case				:			int = 4000000			):
      lowerCAmelCase					:	int       =   [0, 1]
      lowerCAmelCase					:	List[str]       =   0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1]			)
            if fib[i + 2] > n:
                  break
            i += 1
      lowerCAmelCase					:	int       =   0
      for j in range(len(_snake_case			) - 1			):
            if fib[j] % 2 == 0:
                  total += fib[j]

      return total


if __name__ == "__main__":
 print(f"""{solution() = }""")


