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 count(a):
	s = 'bear'
	c = 0
	n = 0
	if(len(a)<len(s)):
		return -1
	for i in range(0,len(a)-3):
		if(s == a[i:i+4]):
			k = i - n
			k = (len(a[i+4:]))*k
			c += k+(len(a)-i+1)
			n = i
	return c-4
			



def main():
	s = input()
	print(count(s))

main()
'''
def checkDistance(nums):
	prev = -1
	for i in range(0,len(nums)):
		if nums[i] == 1:
			if(prev != -1 and i-prev<6):
				return "NO"
			prev = i
	return "YES"		



def main():
	test = int(input())
	for i in range(0,test):
		n = int(input())
		nums = [int(j) for j in input().split()]
		print(checkDistance(nums))

main()













