


"""simple docstring"""


def   snake_case						(				_a:     int = 4000000							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		[0, 1]
      lowerCamelCase__           =		0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1]							)
            if fib[i + 2] > n:
                  break
            i += 1
      lowerCamelCase__           =		0
      for j in range(len(_a							) - 1							):
            if fib[j] % 2 == 0:
                  total += fib[j]

      return total


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







"""simple docstring"""


def   snake_case						(				_a:     int							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		1
      for i in range(1		,   num + 1							):
            fact *= i
      return fact



def   snake_case						(				_a:     int							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		0
      while number > 0:
            lowerCamelCase__           =		number % 10
            sum_of_digits += last_digit
            lowerCamelCase__           =		number // 10  # Removing the last_digit from the given number
      return sum_of_digits



def   snake_case						(				_a:     int = 100							)->		int:
      '''simple docstring'''


      lowerCamelCase__           =		factorial(_a							)
      lowerCamelCase__           =		split_and_add(_a							)
      return result


if __name__ == "__main__":
   print(solution(int(input("Enter the Number: ").strip())))



