





'''simple docstring'''


def 						__a(SCREAMING_SNAKE_CASE_	:       str     ):



    '''simple docstring'''





    if not all(x.isalpha() for x in string     ):
        raise ValueError("String must only contain alphabetic characters."     )

    _lowerCAmelCase						      =   sorted(string.lower()     )
    return len(SCREAMING_SNAKE_CASE_     ) == len(set(SCREAMING_SNAKE_CASE_     )     )


if __name__ == "__main__":
       _SCREAMING_SNAKE_CASE									=				input("Enter a string ").strip()

       _SCREAMING_SNAKE_CASE									=				is_isogram(input_str)
       print(f'''{input_str} is {'an' if isogram else 'not an'} isogram.''')







a__   :					Tuple 						=      "Tobias Carryer"

from time import time



class    UpperCAmelCase__:

   '''simple docstring'''




   def __init__(    self	:      str      ,					lowerCAmelCase	:      List[str]      ,					lowerCAmelCase	:      Any      ,					lowerCAmelCase	:      str      ,					lowerCAmelCase	:      str=int(time()))						->					List[Any]:  # noqa: B008




         """simple docstring"""

         lowercase__  =	multiplier
         lowercase__  =	increment
         lowercase__  =	modulo
         lowercase__  =	seed



   def       UpperCAmelCase		(    self	:      int)						->					Tuple:




         """simple docstring"""

         lowercase__  =	(self.multiplier * self.seed + self.increment) % self.modulo
         return self.seed


if __name__ == "__main__":
       # Show the LCG in action.
       a__   :					str 						=      LinearCongruentialGenerator(1_66_45_25, 10_13_90_42_23, 2 << 31)
       while True:
              print(lcg.next_number())
