Problem: After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reaching its gates was uneasy, but passing through them proved to be even more challenging. Mostly because of Cerberus, the three-headed hound of Hades. 

Orpheus, a famous poet, and musician plans to calm Cerberus with his poetry and safely walk past him. He created a very peculiar poem for Cerberus. It consists only of lowercase English letters. 

We call a poem's substring a palindrome if and only if it reads the same backwards and forwards. A string a is a substring of a string b if a can be obtained from b by deleting several (possibly zero or all) characters from the beginning and several (possibly zero or all) characters from the end.

Unfortunately, Cerberus dislikes palindromes of length greater than 1. For example in the poem abaa the hound of Hades wouldn't like substrings aba and aa.

Orpheus can only calm Cerberus if the hound likes his poetry. That's why he wants to change his poem so that it does not contain any palindrome substrings of length greater than 1.

Orpheus can modify the poem by replacing a letter at any position with any lowercase English letter. He can use this operation arbitrarily many times (possibly zero). Since there can be many palindromes in his poem, he may have to make some corrections. But how many, exactly? Given the poem, determine the minimal number of letters that have to be changed so that the poem does not contain any palindromes of length greater than 1.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 10^5) denoting the number of test cases, then t test cases follow.

The first and only line of each test case contains a non-empty string of lowercase English letters, Orpheus' poem.

The sum of the length of Orpheus' poems in all test cases will not exceed 10^5.

Output

You should output t lines, i-th line should contain a single integer, answer to the i-th test case.

Example

Input


7
babba
abaac
codeforces
zeroorez
abcdcba
bbbbbbb
a


Output


1
1
0
1
1
4
0

Note

In the first test case, we can replace the third character with c and obtain a palindrome-less poem bacba.

In the second test case, we can replace the third character with d and obtain a palindrome-less poem abdac.

In the third test case, the initial poem already doesn't contain any palindromes, so Orpheus doesn't need to change anything there.

Solution (in CPP):

Solution:

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int M = 1000000000;

bool isGood(string& s, int i, int c)
{
    if (i > 0) if (s[i - 1] - 'a' == c) return false;
    if (i > 1) if (s[i - 2] - 'a' == c) return false;
    if (i < s.size() - 1) if (s[i + 1] - 'a' == c) return false;
    if (i < s.size() - 2) if (s[i + 2] - 'a' == c) return false;
    return true;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    for (int t1 = 0; t1 < t; t1++)
    {
        string s;
        cin >> s;
        string org = s;
        int n = s.size();

        if (n == 1) cout << 0 << "\n";
        else
        {
            vector<vector<vector<int>>> dp(n, vector<vector<int>>(2, vector<int>(2, M)));

            if (s[0] == s[1]) {
                dp[1][0][0] = M;
            } else dp[1][0][0] = 0;
            dp[1][1][0] = 1;
            dp[1][0][1] = 1;
            dp[1][1][1] = 2;

            for (int i = 2; i < n; i++)
            {

                for (int j = 0; j <= 1; j++)
                {
                    for (int k = 0; k <= 1; k++)
                    {
                        for (int l = 0; l <= 1; l++)
                        {
                            if (k == 0 && l == 0)
                            {
                                if (s[i] == s[i - 1])
                                {
                                    continue;
                                }
                            }
                            if (j == 0 && l == 0)
                            {
                                if (s[i] == s[i - 2])
                                {
                                    continue;
                                }
                            }
                            dp[i][k][l] = min(dp[i][k][l], dp[i - 1][j][k] + l);
                            //cout << i << " " << k << " " << l << " e " << " " << j << k << endl;
                            //cout << dp[i][k][l] << endl;
                        }
                    }
                }
            }

            int best = M;
            for (int i = 0; i < 2; i++)
            {
                for (int j = 0; j < 2; j++)
                {
                    best = min(best, dp[n - 1][i][j]);
                }
            }
            cout << best << "\n";
        }
    }
}