



def       lowerCamelCase_  (    _a       :						str   ,		_a       :						int = 13    ):



    '''simple docstring'''




    UpperCAmelCase_     :       Union[str, Any]  		=					""""""
    for c in s:
        if "A" <= c <= "Z":
            out += chr(ord("""A"""    ) + (ord(_a    ) - ord("""A"""    ) + n) % 26    )
        elif "a" <= c <= "z":
            out += chr(ord("""a"""    ) + (ord(_a    ) - ord("""a"""    ) + n) % 26    )
        else:
            out += c
    return out







def       lowerCamelCase_  (    ):



    '''simple docstring'''




    UpperCAmelCase_     :       Dict  		=					input("""Enter message: """    )

    UpperCAmelCase_     :       Optional[int]  		=					dencrypt(_a   ,		13    )
    print("""Encryption:"""   ,		_a    )

    UpperCAmelCase_     :       List[str]  		=					dencrypt(_a   ,		13    )
    print("""Decryption: """   ,		_a    )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      main()

"""simple docstring"""


from doctest import testmod
from math import sqrt

def 						UpperCamelCase				(	_lowerCAmelCase   :							int						):
    __a			      =						[]
    if num < 1:
        return facs
    facs.append(1						)
    if num == 1:
        return facs
    facs.append(_lowerCAmelCase						)
    for i in range(2				, int(sqrt(_lowerCAmelCase						)						) + 1						):
        if num % i == 0:  # If i is a factor of num
            facs.append(_lowerCAmelCase						)
            __a			      =						num // i  # num//i is the other factor of num
            if d != i:  # If d and i are distinct
                facs.append(_lowerCAmelCase						)  # we have found another factor
    facs.sort()
    return facs


if __name__ == "__main__":
 testmod(name="""factors_of_a_number""", verbose=True)
