The notation $$x_i = F^i ( x_0 ).$$
defines $x_i$ to be $i^{th}$ iterate of $x_0$ under the function $F$, the result obtained by evaluating $F$ at $x_0$, then evaluating $F$ at $F(x_0)$, then then evaluating $F$ at $F(F(x_0))$, then continuing this process until the function has been evaluated $i$ times. If there exists any $i$ so that $x_i = x_0$, then $F$ has an $i$-cycle at $x_0$.
The notation is an abuse of the ordinary notation of exponentiation of numbers, where $a^nb$ means multiply $b$ by $a$, $n$ times. It helps to think of the case where $F$ is a linear map. Then $F$ has a matrix representation, and in this case the two notations (multiplication and composition) are identical.
For example, $$x_3 = F^3 ( x_0 ) = F(F (F( x_0 )))$$
The condition for $F$ to have a 2-cycle at any point $x$ is $$F(F(x))=x.$$ $x$ need not be a fixed point. If $F$ is not a fixed point, this requires that there exists an $a \neq x$ in the domain of $F$ so that $F(x) = a$ and $F(a) = x.$ Then $F(F(x)) = F(a) = x,$ and so $F$ has a 2-cycle at $x$ given by $\{x,a\}$. Notice that $F$ also has a 2-cycle at $a$ with the same orbit.
If $x$ is any fixed point of $F$, then $F(x) = x$, so the condition above requires that $a = x$. The orbit of the (trivial) 2-cycle is thus given by $\{x\}.$