Croc Champ 2013 - Round 2 (Div. 2 Edition)
E
Cube Problem
Codeforces
未评级
原题
← D→
翻译中…

Yaroslav, Andrey and Roman love playing cubes. Sometimes they get together and play cubes for hours and hours!

翻译中…

Today they got together again and they are playing cubes. Yaroslav took unit cubes and composed them into an $*a* × *a* × *a*$ cube, Andrey made a $*b* × *b* × *b*$ cube and Roman made a $*c* × *c* × *c*$ cube. After that the game was finished and the guys left. But later, Vitaly entered the room. He saw the cubes and wanted to make a cube as well. But what size should the cube be? Of course it should be a large cube with the side of length $*a* + *b* + *c*$. Besides, Vitaly decided to decompose the cubes built by Yaroslav, Andrey and Roman and compose his own large cube out of them. However, it turned out that the unit cubes he got from destroying the three cubes just weren't enough to make a large cube. We know that Vitaly was short of exactly $*n*$ cubes. Vitaly got upset, demolished everything and left. As he was leaving, he met Petya and told him that there had been three cubes in the room and that he needed another $*n*$ unit cubes to make his own large cube.

翻译中…

Petya entered the room and saw the messily scattered cubes. He wanted to make it neat and orderly again. But he only knows that there had been three cubes, made of small unit cubes and that Vitaly needed $*n*$ more unit cubes to make a large one! Help Petya understand, how many ways of sizes $*a*$, $*b*$, $*c*$ are there to restore Yaroslav's, Andrey's and Roman's cubes.

翻译中…

Input

翻译中…

The single line of the input contains integer $*n*$ ($1 ≤ *n* ≤ 10^{14}$). We know that all numbers $*a*$, $*b*$, $*c*$ are positive integers.

翻译中…

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

Output

翻译中…

In the single line print the required number of ways. If it turns out that there isn't a single way of suitable sizes of $*a*$, $*b*$, $*c*$, print 0.

翻译中…

样例

Input #1
24
Output #1
1
InputCopy OutputCopy
Input #2
648
Output #2
7
InputCopy OutputCopy
Input #3
5
Output #3
0
InputCopy OutputCopy
Input #4
93163582512000
Output #4
39090
InputCopy OutputCopy
题目信息
题号
299E
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。