'''simple docstring'''


def    _lowerCamelCase       ( lowerCamelCase_   :				float  ):



     """simple docstring"""





     return -num if num < 0 else num


def    _lowerCamelCase       ( lowerCamelCase_   :				list[int]  ):



     """simple docstring"""





     if len(lowerCamelCase_  ) == 0:
          raise ValueError('abs_min() arg is an empty sequence'  )
     UpperCAmelCase_				:  Optional[Any]  = x[0]
     for i in x:
          if abs_val(lowerCamelCase_  ) < abs_val(lowerCamelCase_  ):
               UpperCAmelCase_				:  str  = i
     return j


def    _lowerCamelCase       ( lowerCamelCase_   :				list[int]  ):



     """simple docstring"""





     if len(lowerCamelCase_  ) == 0:
          raise ValueError('abs_max() arg is an empty sequence'  )
     UpperCAmelCase_				:  Tuple  = x[0]
     for i in x:
          if abs(lowerCamelCase_  ) > abs(lowerCamelCase_  ):
               UpperCAmelCase_				:  List[str]  = i
     return j


def    _lowerCamelCase       ( lowerCamelCase_   :				list[int]  ):



     """simple docstring"""





     if len(lowerCamelCase_  ) == 0:
          raise ValueError('abs_max_sort() arg is an empty sequence'  )
     return sorted(lowerCamelCase_      ,	key=lowerCamelCase_  )[-1]


def    _lowerCamelCase       ( ):



     """simple docstring"""





     assert abs_val(0  ) == 0
     assert abs_val(34  ) == 34
     assert abs_val(-100000000000  ) == 100000000000

     UpperCAmelCase_				:  List[Any]  = [-3, -1, 2, -11]
     assert abs_max(lowerCamelCase_  ) == -11
     assert abs_max_sort(lowerCamelCase_  ) == -11
     assert abs_min(lowerCamelCase_  ) == -1


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 test_abs_val()
 print(abs_val(-34))  # --> 34











'''simple docstring'''






import itertools




def        snake_case_   (	lowerCAmelCase_						)->						Dict:





       '''simple docstring'''


       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        snake_case_   (	)->						str:





       '''simple docstring'''


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


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



