


def 		lowercase_(  ):


  '''simple docstring'''

  lowerCamelCase :					Optional[int]    =				[]
  lowerCamelCase :					List[str]    =				1

  while len(SCREAMING_SNAKE_CASE_	) < 1E6:
    constant.append(str(SCREAMING_SNAKE_CASE_	)	)
    i += 1

  lowerCamelCase :					Union[str, Any]    =				"".join(SCREAMING_SNAKE_CASE_	)

  return (
      int(constant[0]	)
      * int(constant[9]	)
      * int(constant[99]	)
      * int(constant[999]	)
      * int(constant[9999]	)
      * int(constant[99999]	)
      * int(constant[999999]	)
  )


if __name__ == "__main__":
   print(solution())







def 		lowercase_(  SCREAMING_SNAKE_CASE_ = 4000000	):


  '''simple docstring'''

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

  return total


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



