You have to calculate the output in a way that repeated sum of digits until it is before single digit. Multiply those digits which are producing single digit means a final state.

**Example-**

Lets take 19 as example ,19 breaks into 1+9=10 then 10 breaks into 1+0=1. 1 is a single digit sum.

But we have to multiply the at last step before ( the producer of 1 is 10 so take digits of 10) so 1*0=0

So , output Becomes 0

Lets take another example as 129, so 129 breaks into 1+2+9 =12 breaks into 1+2=3. 3 is single digit sum.

So we take 12 and multiply its digits 1*2=2

So , output Becomes 2

**Input Format-**

First Line contains no of test cases by t, and then t inputs.

**Output Format-**

Every case result should be in new line.

**Constraints-**

1<=T<=200

1<=n<=4294967296 (2^{32)}

**Input-**

2

19

129

**Output-**

0

2

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

bhatabhi554 | 317 |

hardikJain5 | 306 |

CodeBuddy | 293 |

Akkki111 | 233 |

clone | 230 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

mazumderrohit8 | 1176 |

RemoveTLE | 1144 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4605 |

Quandray | 4444 |

Login to report an issue on this page.