write a go solution for Description:
You are given a string s consisting of lowercase Latin characters. Count the number of nonempty strings tneq "texttta" such that it is possible to partition^dagger s into some substrings satisfying the following conditions:

- each substring either equals t or "texttta", and
- at least one substring equals t.

^dagger A partition of a string s is an ordered sequence of some k strings t_1,t_2,ldots,t_k (called substrings) such that t_1+t_2+ldots+t_k=s, where + represents the concatenation operation.

Input Format:
The first line contains a single integer t (1<=t<=10^4) — the number of test cases.

The only line of each test case contains a string s consisting of lowercase Latin characters (2<=|s|<=2*10^5).

The sum of |s| over all test cases does not exceed 3*10^5.

Output Format:
For each test case, output a single integer — the number of nonempty strings tneq "texttta" that satisfy all constraints.

Note:
In the first test case, t can be "textttaa", "textttaaa", "textttaaaa", or the full string.

In the second test case, t can be "textttb", "textttbab", "textttba", or the full string.

In the third test case, the only such t is the full string.. Output only the code with no comments, explanation, or additional text.