{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYoung naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself.\u003c/p\u003e\u003cp\u003eBill has a map with coordinates of \u003ci\u003en\u003c/i\u003e ant colonies and \u003ci\u003en\u003c/i\u003e apple trees. He knows that ants travel from their colony to their feeding places and back using chemically tagged routes. The routes cannot intersect each other or ants will get confused and get to the wrong colony or tree, thus spurring a war between colonies.\u003c/p\u003e\u003cp\u003eBill would like to connect each ant colony to a single apple tree so that all \u003ci\u003en\u003c/i\u003e routes are non-intersecting straight lines. In this problem such connection is always possible. Your task is to write a program that finds such connection.\u003c/p\u003e\u003cdiv align\u003d\"center\"\u003e\u003cimg src\u003d\"CDN_BASE_URL/868d7fbfb1a4d2ec3ff192b5ece58d85?v\u003d1715243145\"\u003e\u003c/div\u003e\u003cp\u003eOn this picture ant colonies are denoted by empty circles and apple trees are denoted by filled circles. One possible connection is denoted by lines.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line of the input file contains a single integer number \u003ci\u003en\u003c/i\u003e (1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 100) — the number of ant colonies and apple trees. It is followed by n lines describing n ant colonies, followed by n lines describing n apple trees. Each ant colony and apple tree is described by a pair of integer coordinates \u003ci\u003ex\u003c/i\u003e and \u003ci\u003ey\u003c/i\u003e (−\u003cnobr\u003e10 000\u003c/nobr\u003e ≤ \u003ci\u003ex\u003c/i\u003e, \u003ci\u003ey\u003c/i\u003e ≤ \u003cnobr\u003e10 000\u003c/nobr\u003e) on a Cartesian plane. All ant colonies and apple trees occupy distinct points on a plane. No three points are on the same line.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eWrite to the output file \u003ci\u003en\u003c/i\u003e lines with one integer number on each line. The number written on \u003ci\u003ei\u003c/i\u003e-th line denotes the number (from 1 to \u003ci\u003en\u003c/i\u003e) of the apple tree that is connected to the \u003ci\u003ei\u003c/i\u003e-th ant colony.\u003c/p\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\u003e5\r\n-42 58\r\n44 86\r\n7 28\r\n99 34\r\n-13 -59\r\n-47 -44\r\n86 74\r\n68 -75\r\n-68 60\r\n99 -60\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\r\n2\r\n1\r\n5\r\n3\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}