





def    _lowerCamelCase  (__lowerCamelCase  :     int = 10					,  __lowerCamelCase  :     int = 22     )   ->    int:
			a__     = range(1					,  lowercase_     )
			a__     = range(1					,  lowercase_     )
			return sum(
			    1 for power in powers for base in bases if len(str(base**power     )     ) == power     )


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










'''simple docstring'''


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

			return total


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



