




__a          =			'Tobias Carryer'

from time import time

class   __a:






    """simple docstring"""





    def __init__(				self       ,_SCREAMING_SNAKE_CASE       ,_SCREAMING_SNAKE_CASE       ,_SCREAMING_SNAKE_CASE       ,_SCREAMING_SNAKE_CASE=int(time()  )  )			->		Optional[Any]:  # noqa: B008
      UpperCAmelCase_      :							Union[str, Any]       =      multiplier
      UpperCAmelCase_      :							Any       =      increment
      UpperCAmelCase_      :							List[str]       =      modulo
      UpperCAmelCase_      :							List[Any]       =      seed





    def 							a__				(				self  )			->		List[str]:
      UpperCAmelCase_      :							Union[str, Any]       =      (self.multiplier * self.seed + self.increment) % self.modulo
      return self.seed


if __name__ == "__main__":
     # Show the LCG in action.
     __a          =			LinearCongruentialGenerator(1_664_525, 1_013_904_223, 2 << 31)
     while True:
          print(lcg.next_number())





from __future__ import annotations

from fractions import Fraction







def lowerCamelCase__       (      _lowercase			,						_lowercase				):

     '''simple docstring'''


     return (
         num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
     )







def lowerCamelCase__       (      _lowercase				):

     '''simple docstring'''


     UpperCAmelCase_      :							Optional[int]       =      []
     UpperCAmelCase_      :							Tuple       =      11
     UpperCAmelCase_      :							int       =      int('''1''' + '''0''' * digit_len				)
     for num in range(_lowercase			,						_lowercase				):
          while den <= 99:
               if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
                    if is_digit_cancelling(_lowercase			,						_lowercase				):
                         solutions.append(f'''{num}/{den}'''				)
               den += 1
          num += 1
          UpperCAmelCase_      :							Any       =      10
     return solutions







def lowerCamelCase__       (      _lowercase = 2				):

     '''simple docstring'''


     UpperCAmelCase_      :							Tuple       =      1.0
     for fraction in fraction_list(_lowercase				):
          UpperCAmelCase_      :							Optional[Any]       =      Fraction(_lowercase				)
          result *= frac.denominator / frac.numerator
     return int(_lowercase				)


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