B'After holding one team contest, boy Yura got very tired and wanted to change his life and move to Japan. In honor of such a change, Yura changed his name to something nice. Fascinated by this idea he already thought up a name s consisting only of characters "_" and "^". But there 's a problem -- Yura likes smiley faces "^_^" and "^^". Therefore any character of the name must be a part of at least one such smiley. Note that only the consecutive characters of the name can be a smiley face. More formally, consider all occurrences of the strings "^_^" and "^^" in the string s . Then all such occurrences must cover the whole string s , possibly with intersections. For example, in the string "^^__^_^^__^" the characters at positions 3,4,9,10 and 11 are not contained inside any smileys, and the other characters at positions 1,2,5,6,7 and 8 are contained inside smileys. In one operation Jura can insert one of the characters "_" and "^" into his name s (you can insert it at any position in the string). He asks you to tell him the minimum number of operations you need to do to make the name fit Yura 's criteria. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 100 ) --the number of test cases. The description of test cases follows. The first and only line of each test case contains a single string s ( 1 <= q |s| <= q 100 ), consisting of characters "_" and "^", -- the name to change. For each test case, output a single integer -- the minimum number of characters you need to add to the name to make it fit for Yura. If you don 't need to change anything in the name, print 0 . In the first test case, you can get the following name by adding 5 characters: ^_^_^_^_^_^_^ In the third test case, we can add one character "^" to the end of the name, then we get the name: ^_^ In the fourth test case, we can add one character "^" to the end of t'...