Given a number N, the task is to count all the digits in N which divide N. Divisibility by 0 is not allowed. If any digit in N which is repeated divides N, then all repetitions of that digit should be counted

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.

**Output:**

Print the count of all digits of n which divide n for each test case in a new line.

**Constraints:**

1<= T <=100

1<= No of digits in N <=10^{5}

**Example:**

**Input:**

2

35

122324

**Output:**

1

5

**Explanation:**

For testcase 1: N=35. Now, 3 does not completely divide 35, but 5 does; so our count is 1.

For testcase 2: N=122324. Here, 1 divides N. 2 divides N. Again, 2 divides N. 3 does not divide N. 2 divides N. 4 divides N. So, total number of digits that divide N are 5.

Author: sujnesh

Aditya Singh 17 | 1046 |

stupid_af | 949 |

Dhaya_Mohan | 700 |

ujjwalgupta1 | 671 |

default | 667 |

akhayrutdinov | 4721 |

Quandray | 3750 |

sanjay05 | 3668 |

Ibrahim Nash | 3664 |

surbhi_7 | 2776 |