The number 729 can be written as a power in several ways: 3⁶, 9³ and 27². It can be written as 729¹, of course, but that does not count as a power. We want to go some steps further. To do so, it is convenient to use ‘^’ for exponentiation, so we define a^b = a^b. The number 256 then can be also written as 2^2^3, or as 4^2^2. Recall that ‘^’ is right associative, so 2^2^3 means 2^(2^3).</p>

We define a tower of powers of height k to be an expression of the form a₁^a₂^a₃^...^a_k, with k > 1, and integers a_i > 1.

Given a tower of powers of height 3, representing some integer n, how many towers of powers of height at least 3 represent n?

입력 형식

The input file contains several test cases, each on a separate line. Each test case has the form a^b^c, where a, b and c are integers, 1 < a, b, c ≤ 9585.

출력 형식

For each test case, print the number of ways the number n = a^b^c can be represented as a tower of powers of height at least three.</p>

The magic number 9585 is carefully chosen such that the output is always less than 2⁶³.

예제 입력

4^2^2
8^12^2
8192^8192^8192
2^900^576

예제 출력

2
10
1258112
342025379