import numpy as np

def isSquare(a):
    for i in range(int(a**0.5)+1):
        if i**2 == a:
            return True

    return False


def dfa(x):
    d = int(x**0.5)
    return 4*d+4


if __name__ == '__main__':
    s = input()
    s += 'e'
    a = [0]
    c = 1
    for i in range(0, len(s)-1):
        if s[i] == s[i+1]:
            c += 1
        else:
            a.append(c)
            c = 1 
    a.append(0)

    counter = 0
    for i in range(1, len(a)-1):
        if isSquare(a[i]):
            k = a[i-1] + a[i+1]
            ob = dfa(a[i])
            counter += k-ob+1 if k >= ob else 0
        n = 1
        while n**2 < a[i]:
            if dfa(n**2) <= a[i-1]:
                counter += 1
            if dfa(n**2) <= a[i+1]:
                counter += 1
            n += 1

    print(counter)