Unique Characters Checker

Given a string, determine whether all characters in the string are unique. Formally, for a string ( s ) of length ( n ), the task is to check whether every character appears exactly once. For instance, the string "orange" has all unique characters while "apple" does not.

An efficient solution can use a set to compare the number of unique characters versus the total number of characters, yielding a time complexity of ( O(n) ).

inputFormat

The input consists of a single line containing a string. The string may include alphabets, digits, and special characters. It is read from standard input (stdin).

outputFormat

Output a single line to standard output (stdout) containing 'True' if all characters in the input string are unique; otherwise, output 'False'.## sample

orange

True