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.
string = input()
count  = 0
sum    = 0
def TheBoyerMooreHorspool (string , word):
    date = dict()
    arr  = []
    for i in range(0 , len(word) - 1) :
        date[word[i]] = len(word) - i -1
    pos = 0
    while pos < len(string) - len(word)  :
        j = len(word) - 1;
        while j > -1  and (word[j] == string[pos+j]) :
            j -= 1
        if j == -1 :
            arr.append(pos)
        add = 1
        if j != -1 :
            if string[pos+j] in date.keys() :
                add = date[string[pos + j]]
            else :
                add = len(word) - 1
        pos += add
    return arr
found = TheBoyerMooreHorspool(string , 'bear')
for i in found :
    x = string[slice(count , i+1)]
    count = i+1
    sum += len(x) * (len(string) - (i+3))
print(sum)