{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e dsaCJDASIOHCVAIUDSVCBAIUDKSJCB\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e There are no more than 15 test case.\u003cbr\u003e \u003cbr\u003e For each test case:\u003cbr\u003e \u003cbr\u003e The first line is an integer N, meaning that there are N pillars left in E-pang Palace(4 \u0026lt;\u003dN \u0026lt;\u003d 30).\u003cbr\u003e \u003cbr\u003e Then N lines follow. Each line contains two integers x and y (0 \u0026lt;\u003d x,y \u0026lt;\u003d 200), indicating a pillar\u0027s coordinate. No two pillars has the same coordinate.\u003cbr\u003e \u003cbr\u003e The input ends by N \u003d 0.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e For each test case, print the maximum total area of land Zhang Liang and \u003cspan\u003eXiao\u003c/span\u003e He could get. If it was impossible for them to build two qualified fences, print \"imp\".\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n8\r\n0 0\r\n1 0\r\n0 1\r\n1 1\r\n0 2\r\n1 2\r\n0 3\r\n1 3\r\n8\r\n0 0\r\n2 0\r\n0 2\r\n2 2\r\n1 2\r\n3 2\r\n1 3\r\n3 3\r\n0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\n2\r\nimp\u003c/pre\u003e"}}]}