Given a single integer **N**, your task is to find the smallest number such that the sum of its digits is **N** and it is divisible by **10 ^{N}**.

Examples:

```
Input : N = 5
Output : 500000
500000 is the smallest number divisible
by 10^5 and sum of digits as 5.
Input : N = 20
Output : 29900000000000000000000
```

**Input:**

First line of the input contains an single integer **T**, denoting the number of test cases. Then **T** test cases follows. The only line of each test case contains a single integer **N**.

**Output:**

For each test case output the required answer on a new line.

**Constraints:**

1<=T<=50

0<=N<=100

**Example:
Input:**

2

6

19

6000000

1990000000000000000000

Author: harshitsidhwa

Mr_Bean | 512 |

Dhirendra121 | 353 |

ashu_tech | 181 |

RishabhTanwar1 | 156 |

cds91 | 137 |

Mr_Bean | 651 |

Dhirendra121 | 458 |

kevinyu102589 | 358 |

kinetic | 339 |

舒义然 | 312 |

akhayrutdinov | 4920 |

Ibrahim Nash | 4444 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.