Longest Quote

Write a program that reads a text and prints the quoted fragment with the larger number of words in it. If there are several quoted fragments with longest size, only the first one must be printed. If there are no quoted fragments, the output must be No quotes found.

For instance, given the text:

Mary arrived home and said " what a day " . The dog looked up 
at her and replied " whof "

the answer should be: what a day

Input

The input is a sequence of tokens. Most tokens are words. Some of the tokens may be quotes or punctuation signs. Punctuations and quotes are always separated from nearby words with whitespaces. The input sequence may extend over more than one line. There is always an even number of quotes in the text.

Output

The output is the sequence of tokens inside the first quoted fragment with largest number of words. If there is no such sequence, the output is No quotes found.

Problem information

Author: ProAl1

Generation: 2026-01-25T13:57:29.445Z