#K62642. Unique Characters Checker

    ID: 31577 Type: Default 1000ms 256MiB

Unique Characters Checker

Unique Characters Checker

Given a string s, determine whether it contains all unique characters. In other words, check if no character appears more than once in the string. The problem can be mathematically formulated as: $$|s| = |\{s\}|$$ where \(|s|\) is the length of the string and \(|\{s\}|\) is the number of distinct characters in s.

Your task is to implement a solution that reads a string from standard input and prints True if all characters in the string are unique, and False otherwise.

inputFormat

The input consists of a single line containing the string s. The string may include letters, numbers, whitespace, and special characters.

outputFormat

Output a single line containing either True or False (without quotes) depending on whether the string has all unique characters.

## sample
abcdef
True