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.
def get_bear(s):
    stop,ocur,index = len(s),[],0
    while index < stop:
        if s[index:index+4] == 'bear':
            ocur.append((index,index+3))
            index += 4
        else: index += 1
    return ocur
s,count = input(),0
ch,siz = get_bear(s),len(s);
if ch:
    cut = len(ch)
    count += ch[0][0]*(siz-ch[0][1])
    for y in range(1,cut):
        count += (siz - ch[y-1][1])
        count += 3*(siz - ch[y][1])
        count += (ch[y][0] - ch[y-1][1] - 1) * (siz-ch[y][1])
    count += siz - ch[-1][1]
    print(count)
else: print (0)