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()
# x,y,a,b=map(int,input().split())
# arr=list(map(int,input().split()))
bear=set()
st=set()
arr=[]
n=len(s)
i=0
while i<n-3:
    if s[i:i+4]=="bear":
        # for j in range(i+1):
        #     for k in range(i+3,n):
        #         st.add((j,k))
        arr.append([i,i+3])
        i+=4
    else:
        i+=1
prev=0
sum1=0;sub1=0
n-=1
for i in range(len(arr)):
    ini=arr[i][0]+1
    last=n-arr[i][1]+1
    sum1+=ini*last
    sub1+=prev*last
    prev=ini
print(sum1-sub1)