Isogram Checker

In this problem, you are required to determine whether a given string is an isogram. An isogram is defined as a word or phrase without any repeating letters, ignoring letter case. For example, "Machine" is an isogram, but "Programming" is not.

You need to read the input string from standard input and output either "True" or "False" based on whether the string is an isogram.

inputFormat

The input consists of a single line containing the string to be checked. The string may contain only alphabetic characters and can be empty.

outputFormat

Output "True" if the provided string is an isogram, otherwise output "False".## sample

Machine

True