/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}


package codejam;

import java.io.*;

public class RecycledNumbers {

    private BufferedReader br;
    private BufferedWriter wr;
    
    public RecycledNumbers(String filein,String fileout){
        try{
            br = new BufferedReader(new 
                    InputStreamReader(new FileInputStream(filein)));
            wr = new BufferedWriter(new FileWriter(fileout));
            
            int num = 0;
            num = Integer.parseInt(br.readLine());
            
            for (int i = 1;i<=num;i++){
                String buf = br.readLine();
                String[] bufarray = buf.split(" ");
                int num1 = Integer.parseInt(bufarray[0]);
                int num2 = Integer.parseInt(bufarray[1]);
                int pairs = 0;
                for (int n = num1;n <= num2;n++){
                    int digit = getDigits(n);
                    for (int d = 1;d < digit;d++){
                        if (isTwin(n,digit) && d == (digit/2)+1) break;
                        int pair = (n%((int)Math.pow(10, d)))*((int)Math.pow(10, digit-d))+
                                n/((int)Math.pow(10, d));
                        if (pair > n &&
                                pair <= num2){
                            if (num1 > 1000)
                            System.out.println(n+" "+pair);
                            pairs++;
                        }
                    }
                }
                String out = "Case #"+i+": "+pairs;
                wr.write(out);
                if (i != num)
                    wr.newLine();
            }
            
            br.close();
            wr.close();
        }catch (IOException e){
            System.out.println("IO failure");
        }
    }
    
    private boolean isTwin(int n,int digit){
        if (digit%2 == 1) return false;
        
        return (n%(int)Math.pow(10, digit/2) == n/(int)Math.pow(10, digit/2));
    }
    
    private int getDigits(int n){
        int digit = 1;
        while(n/10 != 0){
            digit++;
            n /= 10;
        }
        
        return digit;
    }
    
    public static void main(String[] args) {
        RecycledNumbers sp = new RecycledNumbers("C-small-attempt0.in","C-small-attempt0.out");
    }
}
