


'''simple docstring'''


def      lowerCamelCase					(      lowerCamelCase  :      int = 400_0000):
      A_						:  Dict          =				[0, 1]
      A_						:  str          =				0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1])
            if fib[i + 2] > n:
                  break
            i += 1
      A_						:  Optional[int]          =				0
      for j in range(len(lowerCamelCase) - 1):
            if fib[j] % 2 == 0:
                  total += fib[j]

      return total


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




'''simple docstring'''


from __future__ import annotations

import math




def      lowerCamelCase					(      lowerCamelCase  :      int):

      if num <= 0:
            A_						:  List[Any]          =				F'{num}: Invalid input, please enter a positive integer.'
            raise ValueError(lowerCamelCase)

      A_						:  str          =				[True] * (num + 1)
      A_						:  Tuple          =				[]
      A_						:  str          =				2
      A_						:  Any          =				int(math.sqrt(lowerCamelCase))

      while start <= end:
            # If start is a prime
            if sieve[start] is True:
                  prime.append(lowerCamelCase)

                  # Set multiples of start be False
                  for i in range(start * start							,						num + 1							,						lowerCamelCase):
                        if sieve[i] is True:
                              A_						:  Union[str, Any]          =				False

            start += 1

      for j in range(end + 1							,						num + 1):
            if sieve[j] is True:
                  prime.append(lowerCamelCase)

      return prime


if __name__ == "__main__":
     print(prime_sieve(int(input('Enter a positive integer: ').strip())))
