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.
for _ in xrange(input()):
	a,b = raw_input().split()
	a = map(int,list(a))
	b = map(int,list(b))
	la = len(a)
	lb = len(b)
	l = min(la,lb)
	cnt = 0
	pre = 0
	for i in xrange(l):
		x = a[la-1-i] + b[lb-1-i] 
		if x + pre > 9:
			cnt += 1
		pre = (x + pre)/10
	if la > l:
		for i in xrange(l,la):
			if a[la - i] + pre > 9:
				cnt += 1
			pre = (a[la - i] + pre)/10
	if lb > l:
		for i in xrange(l,lb):
			if a[lb - i] + pre > 9:
				cnt += 1
			pre = (a[lb - i] + pre)/10
	if cnt == 0:
		print "No carry operation"
	elif cnt == 1:
		print "1 carry operation"
	else:
		print "%d carry operations"%cnt