PROGRAMMING:Boss Ma's counterattack
One day, Boshen got a bunch of matchsticks and put them into numbers, just like the following.
At this time, Ma boss came over, he suddenly realized the opportunity to ridicule Poshen. He said to Poseidon: give you n matchsticks, how many equations can you spell out like "a + B = C"? A, B and C in the equation are integers spelled out with matchstick (if the number is not zero, then the highest order cannot be 0)
be careful:
1. The plus sign and the equal sign need two matchsticks respectively
2. If a ≠ B, then a + B = C and B + a = C are regarded as different equations (a, B, C > = 0)
3. All n matchsticks must be used
###Input format:
An integer representing the number of matchsticks. Ensure that the number of matchsticks does not exceed 24
###Output format:
A total of one line, representing the number of different equations that can be put together
###Input example:
```in
fourteen
```
###Output example:
```out
two
```
answer：If there is no answer, please comment
At this time, Ma boss came over, he suddenly realized the opportunity to ridicule Poshen. He said to Poseidon: give you n matchsticks, how many equations can you spell out like "a + B = C"? A, B and C in the equation are integers spelled out with matchstick (if the number is not zero, then the highest order cannot be 0)
be careful:
1. The plus sign and the equal sign need two matchsticks respectively
2. If a ≠ B, then a + B = C and B + a = C are regarded as different equations (a, B, C > = 0)
3. All n matchsticks must be used
###Input format:
An integer representing the number of matchsticks. Ensure that the number of matchsticks does not exceed 24
###Output format:
A total of one line, representing the number of different equations that can be put together
###Input example:
```in
fourteen
```
###Output example:
```out
two
```
answer：If there is no answer, please comment