Given a rope of length n meters, cut the rope in different parts of integer lengths in a way that maximizes product of lengths of all parts. You must make at least one cut.
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is length of rope denoted by N.
Print the maximizes product of lengths of all parts.
1 ≤ T ≤ 50
1 ≤ N ≤ 100
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.