Unique Characters

In this problem, you are given a string s that may include alphabets, digits, and special characters. Your task is to determine whether all characters in the string are unique. In other words, if no character appears more than once in s, then the answer is True; otherwise, the answer is False. Note that an empty string is considered to have all unique characters.

The check can be mathematically described as verifying whether

\( |s| = |\{ characters\ in\ s \}| \)

where \(|s|\) denotes the length of the string and \(|\{ characters\ in\ s \}|\) is the number of unique characters in the string.

inputFormat

The input consists of a single line containing the string s.

outputFormat

Output a single line: "True" if all characters in s are unique, otherwise "False".## sample

abcdef

True