Longest Unique Substring

Given a string \(s\), find the longest substring that contains no repeated characters. In other words, determine a contiguous substring \(t\) of \(s\) such that all characters in \(t\) are distinct and \(|t|\) is maximized.

For example, for the string "pwwkew", the longest substring without repeating characters is "wke", with a length of 3.

Your task is to read the string from standard input and print the longest substring in the first line, and its length in the second line of the standard output.

inputFormat

The input consists of a single line containing the string \(s\). The string may include spaces and can be empty.

outputFormat

Output two lines: the first line contains the longest substring with no repeating characters, and the second line contains its integer length.

pwwkew

wke
3