Problem: The bear has a string s = s1s2... s|s| (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) = sisi + 1... sj 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 sk = b, sk + 1 = e, sk + 2 = a, sk + 3 = r.

Help the bear cope with the given problem.

Input

The first line contains a non-empty string s (1 ≤ |s| ≤ 5000). It is guaranteed that the string only consists of lowercase English letters.

Output

Print a single number — the answer to the problem.

Examples

Input

bearbtear


Output

6


Input

bearaabearc


Output

20

Note

In the first sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9).

In the second sample, the following pairs (i, j) match: (1, 4), (1, 5), (1, 6), (1, 7), (1, 8), (1, 9), (1, 10), (1, 11), (2, 10), (2, 11), (3, 10), (3, 11), (4, 10), (4, 11), (5, 10), (5, 11), (6, 10), (6, 11), (7, 10), (7, 11).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, j, k, length, ans, koyta, arr[5001], arr1[5001];
  string str;
  cin >> str;
  length = str.length();
  k = 0;
  for (i = 0; i < length - 2; i++) {
    if (str[i] == 'b' && str[i + 1] == 'e' && str[i + 2] == 'a' &&
        str[i + 3] == 'r') {
      arr[k] = i;
      arr1[k++] = i + 3;
    }
  }
  ans = 0;
  length = str.size();
  for (i = 0; i < str.length(); i++) {
    for (j = 0; j < k; j++) {
      if (arr[j] >= i) {
        int last_indx = arr1[j];
        ans += (length - last_indx);
        break;
      }
    }
  }
  cout << ans << endl;
  return 0;
}