


"""simple docstring"""


import math



def   snake_case						(				_a:     Any		,   _a:     int							)->		Optional[Any]:
      '''simple docstring'''


      if 0 not in (x, y):
            # We use the relation x^y = y*log10(x), where 10 is the base.
            return y * math.logaa(lowerCAmelCase__							)
      else:
            if x == 0:  # 0 raised to any number is 0
                  return 0
            elif y == 0:
                  return 1  # any number raised to 0 is 1
      raise AssertionError('This should never happen'							)


if __name__ == "__main__":  # Main function
   # Read two numbers from input and typecast them to int using map function.
   # Here x is the base and y is the power.
   _snake_case          =							'''Enter the base and the power separated by a comma: '''
   _snake_case          =							map(int, input(prompt).split(","))
   _snake_case          =							map(int, input(prompt).split(","))

   # We find the log of each number, using the function res(), which takes two
   # arguments.
   _snake_case          =							res(xa, ya)
   _snake_case          =							res(xa, ya)

   # We check for the largest number
   if resa > resa:
      print("Largest number is", xa, "^", ya)
   elif resa > resa:
      print("Largest number is", xa, "^", ya)
   else:
      print("Both are equal")







"""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() = }""")



