{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eA good hunter kills two rabbits with one shot. But you need to kill the maximal possible number of\r\nrabbits with one shot to become the best hunter in the world. The program \u003ci\u003eRabbit Hunt 2\u003c/i\u003e might be\r\nquite helpful. This program treats all rabbits as points on a plane. It reads coordinates of \u003ci\u003en\u003c/i\u003e rabbits\r\nfrom the input, generates \u003ci\u003eq\u003c/i\u003e different shooting propositions and chooses the one which leads to killing the maximal\r\nnumber of rabbits. A shooting proposition is defined by coordinates of the hunter and the direction of shooting.\r\nThe shot kills all the rabbits lying on the corresponding ray including the rabbit situated at the same point as the hunter.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eA proposition generator uses numbers \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003evx\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003evx\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003evy\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003evy\u003c/i\u003e\u003c/sub\u003e.\r\nCoordinates of the hunter in the first proposition is (\u003ci\u003ex\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e,\u0026nbsp;\u003ci\u003ey\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e), and a direction of shooting is (\u003ci\u003evx\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e,\u0026nbsp;\u003ci\u003evy\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e).\r\nCoordinates and direction in the \u003ci\u003ei\u003c/i\u003e-th proposition (\u003ci\u003ei\u003c/i\u003e \u0026gt; 1) are calculated using these formulas:\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_centered_picture\"\u003e\u003cimg src\u003d\"CDN_BASE_URL/42e4ea979128a8767abcfae7ed6fb058?v\u003d1715362988\" border\u003d\"0\" alt\u003d\"Problem illustration\"\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eUnfortunately, the program \u003ci\u003eRabbit Hunt 2\u003c/i\u003e doesn\u0027t exist yet. Your goal is to create it.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line contains a number of rabbis \u003ci\u003en\u003c/i\u003e (1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 10\u0026nbsp;000). The next \u003ci\u003en\u003c/i\u003e lines contain\r\nthe coordinates of rabbits. Coordinates are integers not exceeding 10\u0026nbsp;000 in their absolute value.\r\nNo two rabbits are situated at the same point. The next line contains a number of shooting\r\npropositions \u003ci\u003eq\u003c/i\u003e (1 ≤ \u003ci\u003eq\u003c/i\u003e ≤ 10\u003csup\u003e6\u003c/sup\u003e). The next line contains integers \u003ci\u003ex\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003ey\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003evx\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003evy\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e\r\n\u003cnobr\u003e(−10\u0026nbsp;000 ≤ \u003ci\u003ex\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003ey\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e ≤ 10\u0026nbsp;000;\u003c/nobr\u003e \u003cnobr\u003e−10 ≤ \u003ci\u003evx\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e, \u003ci\u003evy\u003c/i\u003e\u003csub\u003e1\u003c/sub\u003e ≤ 10)\u003c/nobr\u003e. The last line contains non-negative integers\r\n\u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003ex\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003ey\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003evx\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003evx\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003ea\u003c/i\u003e\u003csub\u003e\u003ci\u003evy\u003c/i\u003e\u003c/sub\u003e, \u003ci\u003eb\u003c/i\u003e\u003csub\u003e\u003ci\u003evy\u003c/i\u003e\u003c/sub\u003e. All these numbers don\u0027t exceed 10\u003csup\u003e5\u003c/sup\u003e.\r\nIt is guaranteed that the direction of shooting is a non-zero vector for all \u003ci\u003eq\u003c/i\u003e propositions. All numbers in lines\r\nare separated by single spaces.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the number of proposition resulting in the maximal quantity of killed rabbits and this quantity.\r\nIf there are several such propositions, output the one with the maximal number.\u003c/div\u003e\u003c/div\u003e"}},{"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\u003e4\r\n0 0\r\n2 0\r\n3 0\r\n2 2\r\n3\r\n-1 -1 1 0\r\n1 0 1 1 1 0 1 0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}