It is 2 ^ 2, I did the ternary version of this problem (detecting missing number in array where every other number appears twice by using ternary analog of xor (adding every digit in same position in ternary base mod 3)) and I got cycle length of 9 = 3 ^ 2.