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()
l=len(s)
"""ll=[]"""
if "bear" in s:
    kk,c=[],0
    j=4
    while j<l+1:
        if s[j-4:j]=="bear":
            kk.append([j-3,j])
        j+=1
    """for i in range(l):
        for t in range(l):
            if "bear" in s[i:t+1]:
                ll.append([i+1,t+1])"""
    c+=(kk[0][0]-1)*(l-kk[0][1]+1)
    for i in kk:
        c+=l-i[1]+1
    f=len(kk)
    for i in range(1,f):
        c+=(kk[i][0]-kk[i-1][0]-1)*(l-kk[i][1]+1)
    print(c)
    """print(len(ll))
    print(ll)
    print(kk)
"""
else:
    print(0)