123

s = input()
n = len(s)
counter = 0

def nod(a,b):
    while (a != 0 and b !=0):
        if (a == b):
            return a
        if (a > b):
            if a % b == 0:
                return b
            a -= b
        else:
            if b % a == 0:
                return a
            b -= a
    if (a == 0):
        return b
    else:
        return a

def nok(a,b):
    return int(a*b/nod(a,b))

def compare(s1,s2,maxl):
    maxp1 = len(s1)
    maxp2 = len(s2)
    p1 = 0
    p2 = 0
    for i in range(0,maxl):
        if (s1[p1] != s2[p2]):
            return False
        p1+=1
        if(p1 == maxp1):
            p1 = 0
        p2+=1
        if(p2 == maxp2):
            p2 = 0

    return True

for k in range(1, n + 1):
    d = nok(k,n)
    if (compare(s[n-k:n], s, d)):
        counter += 1

print(counter)