




'''simple docstring'''





import itertools





def UpperCAmelCase						(					UpperCAmelCase_	):
    return (
        int("""""".join(combination[0:2]	)	) * int("""""".join(combination[2:5]	)	)
        == int("""""".join(combination[5:9]	)	)
    ) or (
        int("""""".join(combination[0]	)	) * int("""""".join(combination[1:5]	)	)
        == int("""""".join(combination[5:9]	)	)
    )





def UpperCAmelCase						(					):
    return sum(
        {
            int("""""".join(pandigital[5:9]	)	)
            for pandigital in itertools.permutations("""123456789"""	)
            if is_combination_valid(UpperCAmelCase_	)
        }	)


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








'''simple docstring'''





from math import exp





def UpperCAmelCase						(					UpperCAmelCase_	):
    return 8 * x - 2 * exp(-x	)





def UpperCAmelCase						(					UpperCAmelCase_      ,  UpperCAmelCase_      ,  UpperCAmelCase_	):
    _a							:       Optional[int]       					=			lower_bound
    _a							:       str       					=			upper_bound
    for _ in range(0      ,  UpperCAmelCase_	):
        _a					,   _a							:       List[str]       					=			xa, xa - (f(UpperCAmelCase_	) * (xa - xa)) / (f(UpperCAmelCase_	) - f(UpperCAmelCase_	))
    return xa


if __name__ == "__main__":
  print(F"""Example: {secant_method(1, 3, 2)}""")


