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.
#!/usr/bin/python
# -*- encoding: utf-8 -*-
# pylint: disable=invalid-name,missing-docstring,bad-builtin
from sys import stdin

def main():
    dstream = stdin.read().split()
    dstream.pop(0)
    dstream = iter(dstream)
    for x, y in zip(dstream, dstream):
        cop, c = 0, 0
        for i in xrange(-1, -max(len(x), len(y)) - 1, -1):
            if -i <= len(x) and -i <= len(y):
                c = (ord(x[i]) + ord(y[i]) + c - 96) // 10
            elif -i <= len(x):
                c = (ord(x[i]) + c - 48) // 10
            else:
                c = (ord(y[i]) + c - 48) // 10
            if c:
                cop += 1
        if cop > 1:
            print cop, "carry operations"
        elif cop:
            print cop, "carry operation"
        else:
            print "No carry operation"

main()