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.
text = input()
start = 0
substring = "bear"
indices = []

while True:
    index = text.find(substring, start)
    if index == -1:
        break
    indices.append(index)
    start = index + 1

sum = 0
rep = 0

for i in range(len(indices)):
    left = i
    right = len(text) - (i + 3 ) - 1
    
    if left < right :
        rep = 1 + ((left + 1)*right)
        
    if right < left : 
        rep = 1 + ((right + 1) * left) 
        
    sum = sum + rep
    
sum = sum - len(indices) + 1

print(sum)