Welcome to ZOJ Problem Sets Information Select Problem Runs Ranklist ZOJ Problem Set - 1575
Koch Curve

Time Limit: 2 Seconds      Memory Limit: 65536 KB Koch Curve is very common in fractal. It has infinite length. The figure above illustrates the creation of a Koch Curve. A line segment L1 (a->d) is given. It is cut into three equal parts. L2 is obtained by rotating the middle part counter-clockwise to vector s->d. The length satisfies the constraint p0p1 = p1p2 = p2p3 = p3p4. We further process on p0->p1, p1->p2, p2->p3, p3->p4 to obtain L3. We proceed with such iteration to obtain Koch Curve. Since the length is increased by 4/3 each iteration, the length of Koch Curve is infinite. With given s and d, you are to provide the result of the n-th iteration.

Input

There are multiple tests, in each test.

The first line contains an integer n (1 <= n <= 7).

The second line contains four floating numbers sx, sy, dx, dy.

Output

For each test print the vertex in the order from s to d. Keep two digits after decimal point.

Print a blank line after each case.

Sample Input

1
0 0 3 0
1
3 0 0 0

Sample Output

0.00 0.00
1.00 0.00
1.50 0.87
2.00 0.00
3.00 0.00

3.00 0.00
2.00 0.00
1.50 -0.87
1.00 0.00
0.00 0.00

Author: DU, Peng
Source: ZOJ Monthly, April 2003
Submit    Status