#K84097. Isogram Checker

    ID: 36343 Type: Default 1000ms 256MiB

Isogram Checker

Isogram Checker

Given a string s, determine whether it is an isogram. An isogram is a word or phrase that does not repeat any letter (i.e. each alphabetic character appears at most once regardless of case), while spaces and hyphens are allowed to appear multiple times.

More formally, the condition can be written in LaTeX as:

\( \forall c \in \{a,\dots,z\}: \text{count}(c) \leq 1 \)

Your task is to read the string from standard input and output True if it is an isogram or False otherwise.

inputFormat

The input consists of a single line containing a string. The string may include uppercase and lowercase letters, spaces, and hyphens.

outputFormat

Output a single line: True if the string is an isogram, or False if it is not.## sample

lumberjack
True