Problem: Toad Rash has a binary string s. A binary string consists only of zeros and ones.

Let n be the length of s.

Rash needs to find the number of such pairs of integers l, r that 1 ≤ l ≤ r ≤ n and there is at least one pair of integers x, k such that 1 ≤ x, k ≤ n, l ≤ x < x + 2k ≤ r, and s_x = s_{x+k} = s_{x+2k}.

Find this number of pairs for Rash.

Input

The first line contains the string s (1 ≤ |s| ≤ 300 000), consisting of zeros and ones.

Output

Output one integer: the number of such pairs of integers l, r that 1 ≤ l ≤ r ≤ n and there is at least one pair of integers x, k such that 1 ≤ x, k ≤ n, l ≤ x < x + 2k ≤ r, and s_x = s_{x+k} = s_{x+2k}.

Examples

Input


010101


Output


3


Input


11001100


Output


0

Note

In the first example, there are three l, r pairs we need to count: 1, 6; 2, 6; and 1, 5.

In the second example, there are no values x, k for the initial string, so the answer is 0.

Solution (in PYTHON3):

Solution:

def parse(c, n):


    l = [-1] * n

    for x in c:
        se = set(x)

        for i in range(len(x) - 1):

            for j in range(i + 1, len(x)):
                k = x[j] - x[i]

                if k > 20:
                    break

                if x[i] + k + k >= n:
                    break

                if x[i] + k + k in se:
                    l[x[i] + k + k] = x[i]
                    break

    res = 0


    prex = -1
    # print(l)

    for i in range(n):
        if l[i] <= prex:
            continue
        res = res + (l[i] - prex) * (n - i);
        # print(prex + 1, l[i], i + 1, n)
        prex = l[i]
    return res


if __name__ == '__main__':

    s = input()

    one = [i for i in range(len(s)) if s[i] == '1']
    zero = [i for i in range(len(s)) if s[i] == '0']

    # print(one)
    # print(zero)

    ans = parse((one, zero), len(s))

    print(ans)