Solve the programming task below in a Python markdown code block.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well. 

Chef likes problems on geometry a lot. Please help him to solve one such problem.

Find all possible triangles with integer sides which has the radius of inscribed circle (also known as incircle) equal to R.

Two triangles are said to be different if they have at least one different side lengths. Formally, let there be two triangles T_{1}, T_{2}. Let a, b, c denote the sides of triangle T_{1}, such that a ≤ b ≤ c. Similarly, Let d, e, f denote the sides of triangle T_{2}, such that d ≤ e ≤ f. Then T_{1} will said to be different from T_{2} if either a ≠ d, or b ≠ e or c ≠ f.

------ Input ------ 

There is a single test case per test file.
The only line of input contains an integer R.

------ Output ------ 

Output in first line single number - number of triangles satisfying statement.
Order the sides of triangles in non-decreasing order. Output all triangles in non-decreasing order, i.e. order first by smallest sides, otherwise by second smallest sides, if first and second sides equal, then by third.

------ Constraints ------ 

$1 ≤ R ≤ 100 $

------ Subtasks ------ 

$Subtask #1: (20 points)  1 ≤ R ≤ 3$
$Subtask #2: (30 points)  1 ≤ R ≤ 20$
$Subtask #3: (50 points)  Original constraints$

------ Example ------ 

Input:
2

Output:
5
5 12 13
6 8 10
6 25 29
7 15 20
9 10 17