Problem Statement:

You want to ship N cubes abroad. The size of each cube is 1 x 1 x 1. You can only ship the cubes by filling them into a single cuboid box. The cost of shipping a cuboid box with dimensions a x b x c is equal to (a + b + c).

You can't leave any empty space in the box, because the cubes would shift and get damaged during the transfer.

You are given an integer N. Print the minimal possible cost for shipping N cubes.

Input Format:

The first line of the input contains an integer T, the number of test cases to follow. Each test case consists of a single line with one integer N (1 ≤ N ≤ 500), the number of cubes to ship.

Output Format:

For each test case, print a single line which contains the minimal possible cost for shipping N cubes.

Sample Input:

4
1
6
7
200

Sample Output:

3
6
9
18