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

Ayush Asthana | 40 |

suuuuiiii | 39 |

Nikita Chouhan | 38 |

sa_sa_sa_sa | 36 |

abhi_3377 | 36 |

Anshul Wadhawan | 906 |

rambo | 868 |

Calahan | 822 |

Suraj Kumar 14 | 792 |

Saurabh Goel | 768 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3543 |

surbhi_7 | 2748 |