#832. Longest word with no repeated letters
Print the longest word of the sentence that has no repeated letters (if there is a tie, the first one). If there is no such word, print `None`.
### Input
One line.
### Output
One word.
Examples
Input
print scratch mouse computer apple variable variable apple
Output
computer
Input
winter player banana garden school banana winter flower
Output
winter
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.