fb pixel

Longest substring with no duplicate letters

Given a string s, you are asked to calculate the longest substring of s with no duplicate letters. The program should print the first occurring one in case of multiple such strings.

Input

The only line of the input contains a string s (1 ≤ |s| ≤ ). s can contain Latin letters, ASCII symbols (~,#$-=_|\/+%^&*()[]’”.!@), spaces, and tabs.

Output

The program should print the longest substring of s with all unique letters.

Examples

Input
Output
hello, world!
, world!
 
To check your solution you need to sign in
Sign in to continue