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.
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;

public class A
{
	private boolean ONLINE_JUDGE=System.getProperty("ONLINE_JUDGE") != null;
	private boolean TESTCASES=true;
	private boolean INTERACTIVE=false;
	private int MAX=100005;
	private long mod=(long)1e9+7;//(long)998244353;
	private int IMX=Integer.MAX_VALUE,IMN=Integer.MIN_VALUE;
	private long LMX=Long.MAX_VALUE,LMN=Long.MIN_VALUE;

	Reader r;
	Writer w;

	void preprocess() throws Exception
	{
		/*Preprocess Here!!*/
	}
	public int gcd(int n1,int n2)
	{
		while(n1 != n2)
        {
            if(n1 > n2)
                n1 -= n2;
            else
                n2 -= n1;
        }
        return n1;
	}
	void solve(int tc) throws Exception
	{
		String str=r.nl();
		int n=str.length();
		int count=0;
		int l=0;
		int r=0;
		while(r<n)
		{
			if(ispal(str,l,r)==true)
			{
				count++;
				if(r-l>=2)
				{
					l=r+1;
				}
				r++;
			}
			else
			{
				r++;
			}
		}
		w.pl(count);

	}
	boolean ispal(String str,int l,int r)
	{
		if(l==r)
			return false;
		else
		{
			while(l<=r)
			{
				if(str.charAt(l)!=str.charAt(r))
					return false;
				l++;
				r--;
			}
			return true;
		}
	}
	
	void run() throws Exception
	{	
		r=!ONLINE_JUDGE || INTERACTIVE? new Reader("Ainput.txt"):new Reader();
		w=!ONLINE_JUDGE || INTERACTIVE? new Writer("Aoutput.txt"):new Writer();
		
		preprocess();
		
		int i,t=TESTCASES? r.ni():1;
		for(i=1;i<=t;i++)
			solve(i);
		
		w.f();
		w.c();
	}
	public static void main(String[] args) throws Exception
	{
		new A().run();
	}
	

	class Reader
	{
		BufferedReader br;
		StringTokenizer st;
		public Reader()
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		public Reader(String f) throws Exception
		{
			br = new BufferedReader(new FileReader(f));
		}
		String get() throws Exception
		{	
			while (st == null || !st.hasMoreElements())
			{
				try
				{
					st =new StringTokenizer(br.readLine());
				}
				catch (IOException  e)
				{
					throw new Exception(e.toString());
				}
			}
			return st.nextToken();
		}
		String nl() throws Exception //nextLine
		{	
			String str = "";
			try
			{
				str = br.readLine();
			}
			catch (IOException e)
			{
				throw new Exception(e.toString());
			}  
			return str;
		}
		int ni() throws Exception //nextInt
		{
			return Integer.parseInt(get());
		}
		long nlo() throws Exception //nextLong
		{
			return Long.parseLong(get());
		}
		double nd() throws Exception //nextDouble
		{
			return Double.parseDouble(get());
		}
		BigInteger nbi() throws Exception //nextBigInteger
		{
			return new BigInteger(get());
		}
		BigDecimal nbd() throws Exception //nextBigDouble
		{
			return new BigDecimal(get());
		}
	}
	
	class Writer{

		PrintWriter pr;
		public Writer()
		{
			pr=new PrintWriter(System.out);
		}
		public Writer(String f) throws Exception
		{
			pr=new PrintWriter(f);
		}
		void p(Object o) throws Exception //print
		{
			pr.print(o);
		}
		void pl(Object o) throws Exception //printline
		{
			pr.println(o);
		}
		void f() throws Exception //flush
		{
			pr.flush();
		}
		void c() throws Exception //close
		{
			pr.close();
		}
		void pf(Object o) throws Exception //printflush
		{
			p(o);
			f();
		}
	}

	class pair<T,G>
	{
		T x; G y;
		public pair(){}
		public pair(T x,G y)
		{
			this.x=x;
			this.y=y;
		}
		public String toString()
		{
			return " <"+x.toString()+","+y.toString()+"> ";
		}
	}
}