write a go solution for Description:
After learning about polynomial hashing, Heidi decided to learn about shift-xor hashing. In particular, she came across this interesting problem.

Given a bitstring yin0,1^n find out the number of different k (0<=k<n) such that there exists xin0,1^n for which y=xoplusmboxshift^k(x).

In the above, oplus is the xor operation and mboxshift^k is the operation of shifting a bitstring cyclically to the right k times. For example, 001oplus111=110 and mboxshift^3(00010010111000)=00000010010111.

Input Format:
The first line contains an integer n (1<=n<=2*10^5), the length of the bitstring y.

The second line contains the bitstring y.

Output Format:
Output a single integer: the number of suitable values of k.

Note:
In the first example:

- 1100oplusmboxshift^1(1100)=1010
- 1000oplusmboxshift^2(1000)=1010
- 0110oplusmboxshift^3(0110)=1010

There is no x such that xoplusx=1010, hence the answer is 3.. Output only the code with no comments, explanation, or additional text.