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.
from  sys import stdin
def test(problem):
    pass
def solve(a):
    ind=0
    n=len(a);tot=0
    for i in range(n):
        if a[i] =='b':
           if a[i:i+4]=="bear":
                    ind+=1
            
                    tot+=(i+1)*(n-(i+4)+1)
                    if ind>1 and ind%2==0:
                        tot-=2
    return tot
    

print(solve(input()))
# n=int(input())
# a,b=list(int(i) for i in stdin.readline().split())
# for i in range(int(input())):
#     l=list(int(i) for i in stdin.readline().split())
    
 
# a="bearaabearc"
# t=-1
# # while:
# print(a.find("bear"))
  

