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.
#include <vector>
#include <iostream>
#include <algorithm>
#include <climits>
#include <numeric>
#define ll long long 

using namespace std;

int main(){
	string s;
	cin>>s;
	int cnt=0;
	for(int i=0;i<s.length();i++){
		vector<char> got;
		int present=0;
		for(int j=i;j<s.length();j++){
			if(present)cnt++;
			else{
				got.push_back(s[j]);
				if(got.size()>=4){
					int n=got.size();
					if(got[n-4]=='b' and got[n-3]=='e' and 
						got[n-2]=='a' and got[n-1]=='r'){
						present=true;
						cnt++;
					}
				}
			}
		}
	}
	cout<<cnt<<endl;
}