Friend or Foe?

Luke has trouble telling apart the star systems of the Rebel Alliance from those of the Empire. He knows the $x, y, z$ coordinates of every Empire system and every Alliance system, but at warp speed there is no time to look each one up.

His targeting computer is an early model: the only thing it can evaluate is the truth value of the inequality

ax + by + cz + d > 0

where $x, y, z$ are a system's coordinates and $a, b, c, d$ are real coefficients. Fixing one choice of $a, b, c, d$ classifies every system at once: a system is treated as belonging to the Empire when the inequality is true, and to the Alliance otherwise.

Such a classifier is usable only when the two groups can be separated by a single plane, i.e. when there exist real numbers $a, b, c, d$ for which the inequality holds for every Empire system and for no Alliance system. For each test case, decide whether such coefficients exist.

The input contains several test cases, followed by a line containing -1 -1.

Each test case begins with a line containing the number of Alliance systems. Each following line gives the integer coordinates $-100 \le x, y, z \le 100$ of one Alliance system. Next comes the number of Empire systems, followed by one line of integer coordinates for each Empire system. The Empire and the Alliance together contain at least one and at most $200$ systems, and all systems have distinct coordinates.

For each test case, print a single line containing YES if there exist real coefficients $a, b, c, d$ such that $ax + by + cz + d > 0$ for every Empire system and $ax + by + cz + d \le 0$ for every Alliance system, or NO if no such coefficients exist.