Chef loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

 Chef has a positive integer N. He can apply any of the following operations as many times as he want in any order:


 Add 1 to the number N.
 Take some digit of N and replace it by any non-zero digit.
 Add any non-zero leading digit to N.

 Find the minimum number of operations that is needed for changing N to the lucky number.


Input
The first line contains a single positive integer T, the number of test cases. T test cases follow. The only line of each test case contains a positive integer N without leading zeros. 


Output
For each T test cases print one integer, the minimum number of operations that is needed for changing N to the lucky number.


Constraints

1 ≤ T ≤ 10

1 ≤ N < 10^100000

Example

Input:
3
25
46
99

Output:
2
1
2
'''
T = int(raw_input())
while T:
    L = [i for i in raw_input().split()]
    d = {pos: color for pos,color in zip(list('FKLRTB'),L)}
    possible_pos = ['FBL','RBK','FRB','KLB','FLT','FRT','RKT','LKT']
    for position in possible_pos:
        for i in range(2):
            if d[position[i]] != d[position[i+1]]: break
        else: print 'YES'; break
    else: print 'NO'
    T -= 1
from collections import deque
import sys
N,M = map(int,raw_input().split())
L = [[] for i in range(N)]
for i in range(N): u,v = map(int,raw_input().split()); L[u-1].append((v-1,0)); L[v-1].append((u-1,1))
def BFS(G,s):
    dq = deque([s]); l = len(G)
    dist = [sys.maxint for i in range(l)]; dist[s] = 0
    while dq:
        vertex = dq.popleft()
        for vi in G[vertex]:
            if dist[vi[0]] > dist[vertex] + vi[1]:
                dist[vi[0]] = dist[vertex] + vi[1]
                if vi[1] == 0: dq.appendleft(vi[0])
                else: dq.append(vi[0])
    return dist[l - 1]
print BFS(L,0)
'''
T = int(raw_input())
while T:
    s = raw_input().strip(); c = 0
    for i in s:
        if i not in ['4','7']: c += 1
    print c; T -= 1