String Summarization

Standing tall on the high Namsan

(omitted)

Build it on a rock

The ground of Seonrin

You are given one or more sentences. Write a program that summarizes the sentences to at most 25 characters by omitting a middle portion according to the rules below.

For convenience of input and output, you are given instead a string $S$ formed by concatenating the sentences with no spaces. Think of the characters from the first character of the string up to the first '.' (period) as one sentence, and the characters from the character after each '.' up to the next '.' as another sentence. For example, if the given string $S$ is 'IamInevitable.IamIronMan.', then 'IamInevitable.' is one sentence and 'IamIronMan.' is another.

The rules are as follows.

1. If the length of $S$ is at most 25, print $S$ as is.
2. If the length of $S$ is greater than 25, consider the part of $S$ excluding the first 11 characters and the last 11 characters. If this remaining part lies entirely within the same sentence, omit it and replace it with '...' (three '.' characters), then print.
3. If neither of the above cases applies, keep only the first 9 characters and the last 10 characters of $S$, replace the middle with '......' (six '.' characters), and print.

The first line gives the length $N$ of the string.

The second line gives a string $S$ consisting of $N$ characters.

Summarize $S$ to at most 25 characters according to the rules given in the problem and print the result.

$2 \leq N \leq 100\,000$

The string $S$ consists only of uppercase letters, lowercase letters, commas (,), and periods (.).

The first character of $S$ is not a period (.).

The last character of $S$ is a period (.).

The ASCII codes for uppercase letters, lowercase letters, commas, and periods are 65-90, 97-122, 44, and 46, respectively.