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.
n=input()
for i in range(0,n):
	x,y=(i for i in raw_input().split())
	l=len(x)
	carry=0
	count=0
	for j in range(0,l):
		if(int(x[j])+int(y[j])+carry>=10):
			count+=1
			carry=int((int(x[j])+int(y[j])+carry)/10)
	if count==0:
		print "No carry operation"
	elif count==1:
		print "1 carry operation"
	else:
		print count,"carry operations"