1. 
/**
* Angewandte Mathematik, SS09, IFB 2C
* ACM Problem #10035 (Primary Arithmetic)
*
* @author David Leib
* @author Julius Tschannerl
* @version 1.0, 04/22/2009
*
* Status : Accepted
* Runtime: 1.120
*/

//package Carry;

import java.util.Scanner;

public class Main {

public static void main(String... args)
{
Scanner sc = new Scanner(System.in);
int carryCount;
long first = sc.nextLong();
long second = sc.nextLong();

while(!(first == 0 && second == 0))
{
carryCount = 0;
while(first != 0 || second != 0){
long preSum = first%10 + second%10;
first /= 10;
second /= 10;
if (preSum > 9){
carryCount++;
int b = 10;
while (first%b == (b-1)){
carryCount++;
b*=10;
}
first++;
}
}
if (carryCount > 1)
System.out.printf("%d carry operations.\n", carryCount);
else if(carryCount == 1)
System.out.println("1 carry operation.");
else
System.out.println("No carry operation.");
first = sc.nextLong();
second = sc.nextLong();
}
}

}