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_and_r_locations = []

def check_if_bear(i):
    global s
    test = "bear"
    if (s[i:i+4] == test):
        return 1
    else:
        return 0
b_and_r_locations.append((0,0))
for i in range(len(s)):
    if (check_if_bear(i)):
        b_and_r_locations.append((i, i+3))
        
print(b_and_r_locations)

if (len(b_and_r_locations) == 0):
    print(0)
    exit()

# min_r = b_and_r_locations[0][1]
# max_b = b_and_r_locations[n-1][1]

res = 0 

for i in range(1, len(b_and_r_locations)):
    if (b_and_r_locations[i][0] == 0):
        res+= (b_and_r_locations[i][0] - b_and_r_locations[i-1][0] + 1) * (len(s) - b_and_r_locations[i][1])
        # print((b_and_r_locations[i][0] - b_and_r_locations[i-1][0] + 1) * (len(s) - b_and_r_locations[i][1]))
    else:
        res+= (b_and_r_locations[i][0] - b_and_r_locations[i-1][0]) * (len(s) - b_and_r_locations[i][1])
        # print((b_and_r_locations[i][0] - b_and_r_locations[i-1][0]) * (len(s) - b_and_r_locations[i][1]))
    
print(res)