Ibrohim and his computer

Cowboy Beblop is a funny little boy who likes to sit at a computer. From somewhere he got two elastic hoops in the form of two-dimensional polygons, not necessarily convex. Since there is no gravity on his spaceship, the hoops calmly hang in the air (in three-dimensional space). Since the hoops are very elastic, Beblop can stretch them, rotate, move or shorten their ribs as much as they want. For both hoops, you are given the number of vertices and the coordinates of each vertex, determined by the three numbers x, y, and z. The vertices are given in the traversal order: vertex 1 is connected to vertex 2, vertex 2 is connected to vertex 3, and so on, the last vertex is again connected to the first. Two hoops are considered geared if it is impossible to part them to an infinitely large distance only by changing the lengths of the edges and moving them, but not crossing along either the segments or the vertices - just like two chains. Initially, the edges of the polygons do not intersect and do not touch. For simplicity, we say that two polygons are strongly geared if the edges of one of the polygons intersect the area of ​​the other in two different directions (from top to bottom and from bottom to top in the plane defined by this polygon) a different number of times. Cowboy Beblop adores his hoops and would like to know if they are tightly geared or not. Since he is busy playing with his dog, he asks you to determine the answer.