Wibowo and his girlfriend are playing with a deck of card. A deck consists of \textbf{52} different cards. Each card has a number (from lowest to highest: \textbf{2}, \textbf{3}, \textbf{4}, \textbf{5}, \textbf{6}, \textbf{7}, \textbf{8}, \textbf{9}, \textbf{10}, \textbf{Jack}, \textbf{Queen}, \textbf{King}, \textbf{Ace}) and a suit (from weakest to strongest: \textbf{Diamond}, \textbf{Club}, \textbf{Heart}, \textbf{Spade}). When two cards are compared, the one with higher number is considered win. If they have the same number then the stronger suit will win. First, Wibowo and his girlfriend split the deck so each one get \textbf{26} cards. The game consists of \textbf{26} rounds. In each round, both Wibowo and his girlfriend pick one card from their hand at the same time and compare it. The winner get one point for that round. Given the initial hand, Wibowo wondered what is the highest point he could possibly get by playing that hand with his girlfriend. \InputFile The first line of input contains an integer \textbf{T} (\textbf{T} ≤ \textbf{100}) denoting the number of test cases. Each case is described in a line which contains \textbf{26} cards, the Wibowo's hand. Each card has two characters, the first one is number and the second one is suit. A number can be varied between \textbf{2}, \textbf{3}, \textbf{4}, \textbf{5}, \textbf{6}, \textbf{7}, \textbf{8}, \textbf{9}, \textbf{T} (\textbf{10}), \textbf{J} (Jack), \textbf{Q} (Queen), \textbf{K} (King), \textbf{A} (Ace). A suit can be varied between \textbf{D} (Diamond), \textbf{C} (Club), \textbf{H} (Heart), \textbf{S} (Spade). Each card is separated by a single space and all cards are distinct. \OutputFile For each case, output in a line a single integer the highest point that Wibowo possibly get by playing that hand.