No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Pythagorean Theorem II

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn mathematics, the Pythagorean theorem — is a relation in Euclidean geometry among the three sides of a right-angled triangle. In terms of areas, it states:

In any right-angled triangle, the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares whose sides are the two legs (the two sides that meet at a right angle).

The theorem can be written as an equation relating the lengths of the sides *a*, *b* and *c*, often called the Pythagorean equation:

where *c* represents the length of the hypotenuse, and *a* and *b* represent the lengths of the other two sides.

Given *n*, your task is to count how many right-angled triangles with side-lengths *a*, *b* and *c* that satisfied an inequality 1 ≤ *a* ≤ *b* ≤ *c* ≤ *n*.

Input

The only line contains one integer *n* (1 ≤ *n* ≤ 10^{4}) as we mentioned above.

Output

Print a single integer — the answer to the problem.

Examples

Input

5

Output

1

Input

74

Output

35

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/25/2021 10:38:31 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|