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.
s = input()

b = 'bear'
if len(s) < 4:
    print(0)
else:
    idx = []
    i = 0
    while i < len(s) - 3:
        
        res = True
        for j in range(4):
            if s[i+j] != b[j]:
                res = False
                break
        if res:
            # prefixes and suffices
            idx.append(i)
            i += 4
        else:
            i += 1
    
    if not idx:
        print(0)
    else:
        ans = (idx[0] + 1) * (len(s) - idx[0] - 3) 
        for j in range(1, len(idx)):
            i = idx[j]
            prev = idx[j-1] 
            ans += (i - prev) * (len(s) - i - 3)

        print(ans)

