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=str(input())
i=0
n=len(s)
ans=0
count=0
while(i<n):
    if s[i:i+4]=="bear":
        if count==0:
            ans=ans+n-i-4+1
            ans=ans+(i-0)*(n-(i+3))
            k=i+1
           # print(ans)
        else:
            p=i-k
            ans=ans+(p)*(n-i-3)
           # print(ans)
            ans=ans+n-i-4+1
           # print(ans)
            k=i+1
        count+=1
        i=i+4
    else:
        i+=1
print(ans)