The bear has a string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub> (record |*s*| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices *i*, *j* (1 ≤ *i* ≤ *j* ≤ |*s*|), that string *x*(*i*, *j*) = *s*<sub class="lower-index">*i*</sub>*s*<sub class="lower-index">*i* + 1</sub>... *s*<sub class="lower-index">*j*</sub> contains at least one string "bear" as a substring.

String *x*(*i*, *j*) contains string "bear", if there is such index *k* (*i* ≤ *k* ≤ *j* - 3), that *s*<sub class="lower-index">*k*</sub> = *b*, *s*<sub class="lower-index">*k* + 1</sub> = *e*, *s*<sub class="lower-index">*k* + 2</sub> = *a*, *s*<sub class="lower-index">*k* + 3</sub> = *r*.

Help the bear cope with the given problem.
The first line contains a non-empty string *s* (1 ≤ |*s*| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.

def solve(s):

    arr = []
    n = len(s)
    for i in range(n):
        if i + 3 < n and s[i] == 'b' and s[i+1] == 'e' and s[i+2] == 'a' and s[i+3] == 'r':
            arr.append(i)

    ans = 0
    l = len(arr)
    for j in range(l):
        after = n - (arr[j] + 4)
        before = 0
        afterBefore = 0
        if j == 0:
            before = arr[j] - 0
            afterBefore = before * after
        if j > 0:
            before = arr[j] - arr[j-1] - 1
            afterBefore = before * after
        ans += after + before + afterBefore + 1

    print(ans)


# Main
def run():

    s = input()
    solve(s)

# end main


# Program Start
if __name__ == "__main__":
    run()