Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Convex Hull Generator

By nfssdq · 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


Discussion
Statistics

61% Solution Ratio

seyedssz Earliest, Jan '17

Tarik.amtoly Fastest, 0.0s

emrul_mu Lightest, 1.7 MB

SIR.24 Shortest, 183B

Submit

Login to submit