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.
from math import *
c = int(raw_input())
oc = 0
k = 0
for i in range(c):
	oc = 0
	k = 0
	ip = raw_input()
	ip = ip.split(' ')
	l = max(len(ip[1]), len(ip[0]))
	ip = map(int, ip)
	for l1 in range(1,l+1):
		#print "l1",l1, ip[0], ip[0] % pow(10,l1) , ip[1], ip[1] % pow(10,l1), k
		if (ip[0] % pow(10,1) + ip[1] % pow(10,1) + k > 9):
			#print "insideif"
			oc = oc + 1
			k = 1
		else:
			k = 0
		ip[0] = int(ip[0]/10)
		ip[1] = int(ip[1]/10)
	if oc == 0:
		print "No carry operation"
	elif oc == 1:
		print oc,"carry operation"	
	else:
		print oc,"carry operations"	
	#print oc