TheE-pangPalace
Input
here are no more than 15 test cse.
For each test case:
The first line is an interger N, meaning that there ear N pillars left in E-pang Palace (4 <= N <= 30).
Then N lines follow. Each line contains two integers x and y (0 <= x,y <= 200), indicating a pillar’s coordinate. No two pillars has the same coodinate.
The input ends by N = 0.
For each test case:
The first line is an interger N, meaning that there ear N pillars left in E-pang Palace (4 <= N <= 30).
Then N lines follow. Each line contains two integers x and y (0 <= x,y <= 200), indicating a pillar’s coordinate. No two pillars has the same coodinate.
The input ends by N = 0.
Output
For each test case, print the maxinum total are of land Zhang Liang and Xiao He could get. If was impossible for them to build two qualified fences, print “imp”.
Sample Input
8
0 0
1 0
0 1
1 1
0 2
1 2
0 3
1 3
8
0 0
2 0
0 2
2 2
1 2
3 2
1 3
3 3
0
Sample Output
</p>2
imp