# 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

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 10
^{10}

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.

## Samples

Input | Output |
---|---|

3 | 1 1 2 4 3 8 |

#### nfssdq

Nafis was a student of Jahangirnagar University, a die-hard programming contestant. His team became the champion in ACM-ICPC Dhaka Regional 2015. He participated in the 39th and 40th ACM-ICPC World Finals. →