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.
str = input()

s = len(str)

counter = 0
first_bear = []
second_bear = []

if s <= 3:
    print(0)
else:
    for i in range(s):
        if str[i:i+4] == 'bear':
            counter += (s - (i+4) + 1)
            
            if len(first_bear) == 0:
                first_bear = [i+1, i+4]
            else:
                second_bear = [i+1, i+4]
        
        if len(second_bear) == len(first_bear):
            counter += (s - second_bear[1] + 1) * (second_bear[0] - first_bear[0] - 1) 

            first_bear = second_bear
            second_bear = []

    print(counter)