Imagine you're a puzzle designer for a popular math magazine. Your latest challenge involves creating a new type of number puzzle called "Triple Harmony." Here's how you explain it to your readers:
Given a non-negative integer n (n ≥ 0), find all "harmonious triples" (a, b, c) that satisfy two conditions:
a + b + c = n
digsum(a) + digsum(b) + digsum(c) = digsum(n)
Where digsum(x) is the sum of digits in number x.
For example, with n = 26, the triple (4, 12, 10) is harmonious because:
4 + 12 + 10 = 26
(4) + (1+2) + (1+0) = (2+6)
Your puzzle asks readers to find the total number of harmonious triples for a given n. Remember, order matters, so (4, 12, 10) and (10, 12, 4) count as different triples.
How many harmonious triples can your readers find for the puzzle number n?

For each test case output one integer, the number of good triples for the given integer n - Order of integers in a triple matters.