Polygon Programming with Ease

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

Read the statement of Problem D! Given a list of meeting locations as specified in the description of Problem D, you have to calculate the locations of the Foreign Offices.


Input

See the input specification of Problem D for the format, and the output specification of Problem D for the meaning of the input.


Output

See the output specification of Problem D for the format, and the input specification of Problem D for the meaning of the output.


Sample Input

5 14 2 20 4 18 12 12 18 10 10
3 -3 5 -2 5 -3 6
3 -2 10 5 10 -1 12

Sample Output

5 10 2 18 2 22 6 14 18 10 18
3 -4 6 -2 4 -2 6
3 -8 12 4 8 6 12

Hint

The relationship between the sample input and output

Source

2002/2003 University of Ulm Local Contest