In a chat window, any user can type lines of text, and what they type is transmitted to every other user. To keep the conversation clean, every four-letter word must be filtered out of each transmitted line.
Write a program that reads several lines of text and replaces every four-letter word (a word made of exactly four letters) with four asterisks (****).
The first line contains a single integer $n$, the number of text lines that follow.
Each of the next $n$ lines contains words separated by spaces. Every word consists only of letters of the alphabet, exactly one space separates adjacent words, and there are no spaces before the first word or after the last word. No line exceeds 80 characters.
Print the $n$ processed lines, with every four-letter word replaced by ****. Separate consecutive output lines with a single blank line.
As shown in the sample, each word - including the last word on a line - is followed by a single space, so every output line ends with a trailing space.