Problem #PRU-35146

Problems Geometry Solid geometry Visual geometry in space

Problem

In the secret service, there are \(n\) agents – 001, 002, ..., 007, ..., \(n\). The first agent monitors the one who monitors the second, the second monitors the one who monitors the third, etc., the nth monitors the one who monitors the first. Prove that \(n\) is an odd number.