For a positive integer n, we denote the integer obtained by reversing the decimal notation of n (without leading zeroes) by rev(n). For example, rev(123) = 321 and rev(4000) = 4.

You are given a positive integer D. How many positive integers N satisfy rev(N) = N + D?

Constraints

* D is an integer.
* 1 ≤ D < 10^9

Input

Input is given from Standard Input in the following format:


D


Output

Print the number of the positive integers N such that rev(N) = N + D.

Examples

Input

63


Output

2


Input

75


Output

0


Input

864197532


Output

1920
def solve(k, d, fl):
    if k <= 1:
        if d == 0:
            return 10 ** k
        return 0
    x = (-d) % 10
    c = 9 - x + 1 - fl
    d -= 10 ** (k - 1) * x - x
    return c * solve(k - 2, abs(d) // 10, 0)

d = int(input())

ans = 0
for i in range(1, 100):
    ans += solve(i, d, 1)
print(ans)
