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 main():
    s = input()
    n = len(s)
    indexes = [(0, 0)]
    for i in range(n - 4 + 1):
        if s[i] == 'b' and s[i + 1] == 'e' and s[i + 2] == 'a' and s[i + 3] == 'r':
            indexes.append((i, i + 3))
    count = 0
    for j in range(1, len(indexes)):
        for i in range(n):
            if i <= indexes[j][0]:
                if (i > indexes[j - 1][0]) or (j == 1):
                    count += (n - indexes[j][1])
                
            else:
                break
    print(count)








if __name__ == "__main__":
    main()