PROGRAMMING:Right triangle (2014 Fenghua junior high school)
The lengths of the three sides of the triangle are all positive integers. Find the number s of right triangles whose sum of the three sides does not exceed n.
###Input format:
Only one row and only one positive integer: n
###Output format:
There is only one row and only one positive integer: s
###Input example:
```in
fifteen
```
###Output example:
```out
one
```
[example description]
When the three sides are 3, 4 and 5, a right triangle can be formed, and the sum of the three sides is 12, no more than 15
[data scale]
30% of data: 1 < = n < = 100
70% of data: 1 < = n < = 1 000
100% data: 1 < = n < = 10 000
answer：If there is no answer, please comment
###Input format:
Only one row and only one positive integer: n
###Output format:
There is only one row and only one positive integer: s
###Input example:
```in
fifteen
```
###Output example:
```out
one
```
[example description]
When the three sides are 3, 4 and 5, a right triangle can be formed, and the sum of the three sides is 12, no more than 15
[data scale]
30% of data: 1 < = n < = 100
70% of data: 1 < = n < = 1 000
100% data: 1 < = n < = 10 000
answer：If there is no answer, please comment