Once - peas, two - peas...#340

Once - peas, two - peas...

1 second
64 megabytes
Very easy

Winter was approaching, and Speedy and Steady decided to stock up on peas. All day, they ran to the barn and each carried several pods: Steady brought four at a time, and Speedy brought two at a time. In the evening, they counted all the pods they had brought and started thinking about how to divide the peas. Steady claimed that since he carried twice as many at a time as Speedy, he should get twice as many peas. Speedy reasonably objected that, first, Steady is noticeably slower than Speedy, and, second, who knows, maybe Steady only made one or two trips and lounged the rest of the time...

Help your friends understand this tricky situation. Find all possible options for how many pods Speedy and Steady each brought.

Input

The first line contains a natural even number — the number of pods brought, 2 \le M \le 1000.

Output

Print all possible combinations of the number of pods brought by Speedy and by Steady, one combination per line. Each combination should consist of two non-negative integers separated by a space: the first is the number of pods Speedy brought, the second is the number Steady brought. List the combinations in descending order by the first number.

Examples

Example 1

Loading
Loading