시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 1024 MB124695455.102%

문제

You are given a positive integer $A$. Find the number of factors of $A$ which are palindromes. A number is called a palindrome if it remains the same when the digits in decimal representation are reversed. For instance, 121 is a palindrome, while 123 is not.

입력

The first line of the input gives the number of test cases, $T$. $T$ lines follow.

Each line represents a test case and contains a single integer $A$.

출력

For each test case, output one line containing Case #x: y, where $x$ is the test case number (starting from 1) and $y$ is the number of factors of $A$ which are palindromes.

제한

  • $1≤T≤100$.

Test Set 1 (6점)

  • $1≤A≤10^3$.

Test Set 2 (9점)

  • $1≤A≤10^{10}$.

예제 입력 1

4
6
10
144
242

예제 출력 1

Case #1: 4
Case #2: 3
Case #3: 7
Case #4: 6

힌트

In the first test case, $A$ has $4$ factors which are palindromes: $1$, $2$, $3$, and $6$.

In the second test case, $A$ has $3$ factors which are palindromes: $1$, $2$, and $5$.

In the third test case, $A$ has $7$ factors which are palindromes: $1$, $2$, $3$, $4$, $6$, $8$, and $9$.

In the fourth test case, $A$ has $6$ factors which are palindromes: $1$, $2$, $11$, $22$, $121$, and $242$.

채점 및 기타 정보

  • 예제는 채점하지 않는다.