Unique Character Checker

You are given a string s that consists only of lowercase alphabetical characters. Your task is to determine whether all the characters in the string are unique. In other words, check if there are no repeated characters in the string.

The problem can be formalized as follows:

Given a string \( s \), output True if every character in \( s \) occurs exactly once, and False otherwise.

Note: An empty string is considered to have all unique characters.

For example:

• For \( s = "abcdefg" \), the output should be True.
• For \( s = "aabc" \), the output should be False.

inputFormat

The input is read from standard input (stdin) and consists of a single line containing the string \( s \). The string \( s \) is composed only of lowercase English letters.

For example: hello

outputFormat

Output to standard output (stdout) a single line: True if all characters in \( s \) are unique, otherwise False.

## sample

True