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()
n = len(s)
l = []
i = k = d = 0
while i < n:
    if s[i] == "b" and s[i + 1] == "e" and s[i + 2] == "a" and s[i + 3] == "r":
        d += 1
        l.append(i + 1)
        l.append(i + 4)
    i += 1

if d == 1:
    print(n - 3)
    exit()
else:
    k += n - 3
    for i in range(1, d):
        k += (n - l[i * 2 + 1] + 1) * (l[i * 2] - l[i * 2 - 2])

print(k)
#bearbearbear
"""
1 4
1 5
1 6
1 7
1 12
2 8 12
3 8 12
4 8 12
5 8 12
6 12
7 12
8 12
9 12
"""