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.
#CodeHunt-10
def ans(x,y):
    ans=0
    for i in xrange(0,len(x)):
        carry = int(x[i])+int(y[i])
        if(carry>9):
            ans+=1
            if(i<len(x)-1):
                x[i+1]=int(x[i+1])+1
    return int(ans)
            
            
        
            
            
for _ in xrange(input()):
    x,y=raw_input().split()
    x=list(x)[::-1]
    y=list(y)[::-1]
    diff=len(x)-len(y)
    if(diff>0):
        while(diff):
            y.append('0')
            diff-=1
    else:
        while(diff):
            x.append('0')
            diff-=1
    to = ans(x,y)
    if(to==1):
        print to,"carry operation"
    elif(to>1):
        print to,"carry operations"
    else:
        print "No carry operation"