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  de  ll  rlowoThat is, the characters must be printed in the original order, starting top-down from the left vertical line with n1characters, 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 <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.
Input Specification:
Each input file contains one test case. 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.
Output Specification:
For each test case, print the input string in the shape of U as specified in the description.
Sample Input:
helloworld!Sample Output:
h   !e   dl   llowor
#include <cstdio>#include <algorithm>#include <cmath>#include <cstring>#define Max 110using namespace std;int main(){	char s[Max]={};	int sum=0,x,y,z,f=0;	gets(s);	sum=strlen(s);	x=y=(sum+2)/3;	z=sum+2-2*x;	char ss[Max][Max];	for(int i=0;i<Max;i++)		for(int j=0;j<Max;j++) ss[i][j]=' ';	for(int i=0;i<x;i++) ss[i][0]=s[f++];	for(int i=1;i<z;i++) ss[x-1][i]=s[f++];	for(int i=x-2;i>=0;i--) ss[i][z-1]=s[f++];	for(int i=0;i<x;i++)	{		for(int j=0;j<z;j++)		{							printf("%c",ss[i][j]);					 		}		printf("/n");	}	system("pause");	return 0;}