Poornimites are taught to add multi-digit numbers from right-to-left one digit at a time.
Many find the "carry" operation - in which 1 is carried from one digit position
to be added to the next - to be a significant challenge.  Your job is to
count the number of carry operations for each of addition problem so that educators may assess their difficulty.

For the input first line contains n number of records which is less then 1000. And then each line contains two numbers with spacing between them as shown in sample. 

SAMPLE INPUT
3
123 456
555 555
123 594

SAMPLE OUTPUT
No carry operation
3 carry operations
1 carry operation

Explanation

EXAMPLE 1:-

when the digits are added then there is no carry found as 3+6=9,2+5=7 and 1+4=5.

EXAMPLE 2:-

when the digits are added then carry is generated as 5+5 =10 so carry is found 3 times.

EXAMPLE 3:-

when the digits 9 and 2 are added only then carry is found so 1 time only.
def main():
 for t in range(input()):
  a=raw_input()
  l1=len(a)
  i=l1-1
  while i>=0:
   if a[i]==' ':
    break
   i=i-1
  b=a[i+1:l1]
  a=a[0:i]
  l1=len(a)
  l2=len(b)
  if l1>l2:
   i=l1-l2
   j=0
   add=""
   while j<i:
    add=add+'0'
    j=j+1
   b=add+b
  elif l2>l1:
   i=l2-l1
   j=0
   add=""
   while j<i:
    add=add+'0'
    j=j+1
   a=add+a
  l=len(a)
  i=l-1
  count=0
  carry=0
  while i>=0:
   summ=ord(a[i])+ord(b[i])-96+carry
   if summ>9:
    carry=1
    count=count+1
   i=i-1
  if count==0:
   print "No carry operation"
  elif count==1:
   print count,"carry operation"
  else:
   print count,"carry operations"
main()