1-vs-2 cycles problem

Problem

In the theory of parallel algorithms, the 1-vs-2 cycles problem concerns a simplified case of graph connectivity. The input to the problem is a 2-regular graph, forming either a single connected $n$-vertex cycle or two disconnected $n/2$-vertex cycles. The problem is to determine whether the input has one or two cycles.