题目描述 Given any string of $ N $ ($ >=5 $) characters, you are asked to form the characters into the shape of $ U $. For example, "helloworld" can be printed as: h ! e d l l lowor That is, the characters must be printed in the original order, starting top-down from the left vertical line with $ n1 $ characters, then left to right along the bottom line with $ n2 $ characters, and finally bottom-up along the vertical line with $ n3 $ characters. And more, we would like $ U $ to be as squared as possible -- that is, it must be satisfied that $ n1 = n3 = \max \{ k k \leq n2 \text{ for all } 3 \leq n2 \leq N \} $ with $ n1 + n2 + n3 - 2 = N $. 输入格式 There are multiple test cases. Each case contains one string with no less than $ 5 $ and no more than $ 80 $ characters in a line. The string contains no white space. 输出格式 For each test case, print the input string in the shape of $ U $ as specified in the description. 输入样例 helloworld! 输出样例 h ! e d l l lowor