{"trustable":true,"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":"\u003cdiv class\u003d\"panel_content\"\u003eNoticeļ¼Don\u0027t output extra spaces at the end of one line.\u003cbr\u003e\u003cbr\u003eDodo bird and ddd are playing a stone game on a 2-d plane. There are $n$ points on the plane where they can put the stone. The rule is as follows:\u003cbr\u003e\u003cbr\u003e- Before the game start, The stone is at the first point.\u003cbr\u003e- Dodo and ddd move the stone in turn, Dodo moves first.\u003cbr\u003e- In the first move, the player can move the stone to any point except the first point. \u003cbr\u003e- Starting from the second move, assume the stone is currently at point $x$, and the distance of the stone traveled in the last move is $d$. The player can move the stone to a point $y$ if and only if $\\text{distance(x,y)} \u0026gt; d$ and point $y$ has never been visited before.\u003cbr\u003e- If a player cannot make a move, he loses the game.\u003cbr\u003e\u003cbr\u003ePlease determine who will win the game if both player use the best strategy.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains an integer $T(1 \\leq T \\leq 100)$, indicating the number of test cases.\u003cbr\u003e\u003cbr\u003eEach test case contains several lines. The first line contains an integer $n(2 \\leq n \\leq 2000)$, indicating the number of points. Next $n$ lines, each line contains two integers $x_i, y_i(-10^9 \\leq x, y \\leq 10^9)$, indicating the coordinate of the i-th point.\u003cbr\u003e\u003cbr\u003eIt is guaranteed that there are at most 12 test cases with $n \u0026gt; 500$.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, If Dodo can win the game, print \"YES\". Otherwise, print \"NO\"."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n5\r\n1 1\r\n0 0\r\n2 0\r\n0 2\r\n2 2\r\n4\r\n1 1\r\n0 0\r\n0 2\r\n2 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNO\r\nYES\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}