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.
# 1.Loop through the string, find all the indexes that
# s[index:index+4] == bear and store them in list index_b_bear.
# 2. Loop through the list index_b_bear and in each loop, add
# (len(s) - index + index + 4) to answer.

pair_total = 0
pair_contain_bear = set()
latest_index_b = -1
string = input()
for i in range(0, len(string)):
    if string[i : i + 4] == 'bear':
        pair_total += (i + 1) * (len(string) + 1 - (i + 4))
        if latest_index_b != -1:
            pair_total -= (latest_index_b+1) * (len(string)+1-(i+4))
        latest_index_b = i

# print(pair_contain_bear)
print(pair_total)