## Algorithm

C. Help Farmer
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Once upon a time in the Kingdom of Far Far Away lived Sam the Farmer. Sam had a cow named Dawn and he was deeply attached to her. Sam would spend the whole summer stocking hay to feed Dawn in winter. Sam scythed hay and put it into haystack. As Sam was a bright farmer, he tried to make the process of storing hay simpler and more convenient to use. He collected the hay into cubical hay blocks of the same size. Then he stored the blocks in his barn. After a summer spent in hard toil Sam stored A·B·C hay blocks and stored them in a barn as a rectangular parallelepiped A layers high. Each layer had B rows and each row had C blocks.

At the end of the autumn Sam came into the barn to admire one more time the hay he'd been stacking during this hard summer. Unfortunately, Sam was horrified to see that the hay blocks had been carelessly scattered around the barn. The place was a complete mess. As it turned out, thieves had sneaked into the barn. They completely dissembled and took away a layer of blocks from the parallelepiped's front, back, top and sides. As a result, the barn only had a parallelepiped containing (A - 1) × (B - 2) × (C - 2) hay blocks. To hide the evidence of the crime, the thieves had dissembled the parallelepiped into single 1 × 1 × 1 blocks and scattered them around the barn. After the theft Sam counted n hay blocks in the barn but he forgot numbers AB и C.

Given number n, find the minimally possible and maximally possible number of stolen hay blocks.

Input

The only line contains integer n from the problem's statement (1 ≤ n ≤ 109).

Output

Print space-separated minimum and maximum number of hay blocks that could have been stolen by the thieves.

Note that the answer to the problem can be large enough, so you must use the 64-bit integer type for calculations. Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specificator.

Examples
input
Copy
`4`
output
Copy
`28 41`
input
Copy
`7`
output
Copy
`47 65`
input
Copy
`12`
output
Copy
`48 105`
Note

Let's consider the first sample test. If initially Sam has a parallelepiped consisting of 32 = 2 × 4 × 4 hay blocks in his barn, then after the theft the barn has 4 = (2 - 1) × (4 - 2) × (4 - 2) hay blocks left. Thus, the thieves could have stolen 32 - 4 = 28 hay blocks. If Sam initially had a parallelepiped consisting of 45 = 5 × 3 × 3 hay blocks in his barn, then after the theft the barn has 4 = (5 - 1) × (3 - 2) × (3 - 2) hay blocks left. Thus, the thieves could have stolen 45 - 4 = 41 hay blocks. No other variants of the blocks' initial arrangement (that leave Sam with exactly 4 blocks after the theft) can permit the thieves to steal less than 28 or more than 41 blocks.

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <bits/stdc++.h>

using namespace std;

long long n;
vector <long long> d;

void divisors(long long x) {
d.clear();
int sqrtx = sqrt(x);
for(int i = 1; i  <= sqrtx + 1; ++i)
if(x % i == 0) {
d.push_back(i);

if(x / i != i)
d.push_back(x / i);
}
sort(d.begin(), d.end());
}

int main() {
cin >> n;
divisors(n);

long long mn = 2e18, mx = -2e18;
for(int i = 0; i  < d.size(); ++i)
for(int j = i; j  < d.size(); ++j)
if(n % (d[i] * d[j]) == 0) {
long long k = n / (d[i] * d[j]);

mn = min(mn, (d[i] + 1) * (d[j] + 2) * (k + 2) - n);
mx = max(mx, (d[i] + 1) * (d[j] + 2) * (k + 2) - n);

mn = min(mn, (d[i] + 2) * (d[j] + 1) * (k + 2) - n);
mx = max(mx, (d[i] + 2) * (d[j] + 1) * (k + 2) - n);

mn = min(mn, (d[i] + 2) * (d[j] + 2) * (k + 1) - n);
mx = max(mx, (d[i] + 2) * (d[j] + 2) * (k + 1) - n);
}

cout  < < mn  < < ' '  < < mx  < < endl;

return 0;
}``````
Copy The Code &

Input

cmd
4

Output

cmd
28 41