Potion Placement on an Infinite Grid

You are given an integer m, representing the number of potions. The initial position of the i-th potion (0-indexed) is determined by the formulas:

\( x = 2 \times i \) and \( y = 2 \times (i \bmod 2) \).

Your task is to generate m distinct coordinates following these formulas and print each pair on a separate line.

For example, if m = 3, the positions will be:

• For i = 0: (0, 0)
• For i = 1: (2, 2)
• For i = 2: (4, 0)

Note that the coordinates must be printed in order from i = 0 to i = m-1.

inputFormat

The input consists of a single integer m (1 ≤ m ≤ 10⁵), which is the number of potions.

outputFormat

Output m lines. Each line contains two space-separated integers representing the x and y coordinates of each potion, in order from the first potion to the last.

## sample

3

0 0
2 2
4 0

</p>