Solve the mystery

HINT : Digital Display
Input :
First line has an integer T.
Next T lines has an integer N in each line. It is guaranteed that N never starts with 0 unless value is equal to zero.

Output :
Print the output for each test case in new line.

Constraints :
1 ≤ T ≤ 1000
0 ≤ |N| ≤ 1000
|N| is number of digits.

Problem Setter : Vinay Kumar

SAMPLE INPUT
8
1234567
123456
1234
193
12
11
1
0

SAMPLE OUTPUT
30
27
16
13
7
4
2
6
for t in range(input()):
 s=raw_input()
 i=0
 l=len(s)
 count=0
 while i<l:
  ch=s[i]
  if ch=='0':
   count=count+6
  elif ch=='1':
   count=count+2
  elif ch=='2':
   count=count+5
  elif ch=='3':
   count=count+5
  elif ch=='4':
   count=count+4
  elif ch=='5':
   count=count+5
  elif ch=='6':
   count=count+6
  elif ch=='7':
   count=count+3
  elif ch=='8':
   count=count+7
  else:
   count=count+6
  i=i+1
 print count