Distinct Triangles

Given an integer \( S \) representing the total side lengths of squares used to form triangles, determine the number of distinct triangles possible. In this problem, by definition, the number of distinct triangles is exactly equal to \( S \). Although the problem might seem trivial, it serves as an exercise in correctly handling input and output from standard streams for beginner programmers.

Note: All formulas are written in LaTeX format.

inputFormat

The input consists of a single integer \( S \) provided via stdin, which represents the total side lengths of squares available.

outputFormat

Print a single integer to stdout that is exactly equal to \( S \), representing the number of distinct triangles possible.

1

1