17606번 - Integral Points 스페셜 저지다국어

We say a set of points are concyclic if they all lie on the circumference of a circle. The task is: given an integer n, find a circle centered at (0, 0) such that there are at least n distinct concyclic integral points lying on it.

Note: Integral points are points with integral coordinates.

The input is a line containing a positive integer n.

Output n + 1 lines. The first line contains an integer r indicating the radius of the circle. Each of the following lines contains two integers x and y such that point (x, y) lies on the circle.

• 1 ≤ n ≤ 1000
• This problem uses a special checker so you don’t have to output the minimum radius r.
• Each token in your output cannot exceed 30 characters.
• Every point in your output must be unique.
• The size of your code must be no greater than 256 kilobytes.