Moderate Pace

문제

An ultra-marathon is a race that takes place over an uncomfortably long distance and time, typically lasting for five hours or more. You are part of a group of three ultra-marathon runners looking to place in this year's Great South-to-North run from Plymouth to Aberdeen.

You have a set number of days until the next race to train. You will all train together, as training alone can be dangerous. As everyone has their own schedule in mind for how many kilometres to run per day, this will not be easy, you will have to compromise.

The fairest option is to look at each day individually, examine the three options for how far to run, and to take the median one. That is to say, the option taken for each day should be one that is not be greater or lesser than both of the other possibilities at the same time.

입력

• A line with the integer $nn$ ($1\le n\le 10001\backslash leq\; n\backslash leq1000$), the number of days of training.
• A line with $nn$ integers $k_{1,\dots ,n}k\_\{1,\backslash ldots,n\}$ ($0\le k\le {10}^{6}0\backslash leq\; k\; \backslash leq\; 10^6$), your ideal daily distances.
• A line with $nn$ integers $a_{1,\dots ,n}a\_\{1,\backslash ldots,n\}$ ($0\le a\le {10}^{6}0\backslash leq\; a\; \backslash leq\; 10^6$), your first colleague's ideal daily distances.
• A line with $nn$ integers $b_{1,\dots ,n}b\_\{1,\backslash ldots,n\}$ ($0\le b\le {10}^{6}0\backslash leq\; b\; \backslash leq\; 10^6$), your second colleague's ideal daily distances.

출력

Output a plan for the $nn$ days as $nn$ integers, where the distance for every day corresponds to the median of choices for that day.