Sequence and Chains

Sam wants to play a game called “chain”. Sam has the sequence of symbols. Each symbol is either '-' or '+'. The sequence is called Chain if each two neighboring symbols of sequence are either '-+' or '+-'.

For example sequence '-+-+-+' is a Chain but sequence '-+-+--+' is not.

Help Sam to calculate the minimum number of symbols he need to replace (ex. '-' to '+' or '+' to '-') to receive a Chain sequence.
        
       Input:-2
---+-+-+++
-------
       Input Description: -First line contains single integer T denoting the number of test cases.
-Line of each test case contains the string S consisting of symbols '-' and '+'. 
       Output: 2
3
       Output Description: For each test case, in a single line print single interger - the minimal number of symbols Sam needs to replace to receive a Chain. 
       Constraints: 1 <= T <= 7
1 <= |S| <= 10^5
       Explanation: Example case 1. We can change symbol 2 from '-' to '+' and symbol 9 from '+' to '-' and receive '-+-+-+-+-+'.

Example case 2. We can change symbols 2, 4 and 6 from '-' to '+' and receive '-+-+-+-'.