Convex Hull Generator

nfssdq ProgKriya May'16
Limits 1s, 512 MB · Custom Checker

You have to generate a convex polygon which

  • has N points
  • each Xi is distinct and is between 1 and N
  • Each Yi is positive and less than 1010

There can be many many convex polygons that fits this description. You have to print any one of them.

Input

The only line in input is N (3 ≤ N ≤ 100000).

Output

Print N lines. Each line will contain two integers Xi and Yi.

Sample

InputOutput
3
1 1
2 4
3 8

Submit

Login to submit.

Statistics

63% Solution Ratio
sahedsohelEarliest, May '16
Tarik.amtolyFastest, 0.0s
borderLightest, 131 kB
bokaifShortest, 47B
Toph uses cookies. By continuing you agree to our Cookie Policy.