Children are taught to add multi-digit numbers from right to left, one digit at a time.
Many find the “carry” operation, where a 1 is carried from one digit position to the
next, to be a significant challenge. Your job is to count the number of carry operations for each of a set of addition problems so that educators may assess their difficulty.

Input

Each line of input contains two unsigned integers less than 10 digits. The last line of input contains “0 0”.

Output

For each line of input except the last, compute the number of carry operations that result from adding the two numbers and print them in the format shown below.

Example

Input:
123 456
555 555
123 594
0 0

Output:
No carry operation.
3 carry operations.
1 carry operation.
while 1:
	N,M=map(int,raw_input().split());
	if N==0 and M==0:
		break
	else:
		A,B=N,M; CR=0; ct=0;
		while A or B:
			q,r=A%10,B%10;
			if q+r+CR>9:
				ct+=1;	CR=1;
			A/=10;	B/=10;
		if ct==0:
			print "No carry operation."
		elif ct==1:
			print "1 carry operation."
		else:
			print "%d carry operations." %ct