# [Solution] Round Down the Price solution codeforces

Round Down the Price solution codeforces – At the store, the salespeople want to make all prices round.

In this problem, a number that is a power of 1010 is called a round number. For example, the numbers 100=1100=1101=10101=10102=100102=100 are round numbers, but 2020110110 and 256256 are not round numbers.

## [Solution] Round Down the Price solution codeforces

So, if an item is worth 𝑚m bourles (the value of the item is not greater than 109109), the sellers want to change its value to the nearest round number that is not greater than 𝑚m. They ask you: by how many bourles should you decrease the value of the item to make it worth exactly 10𝑘10k bourles, where the value of 𝑘k — is the maximum possible (𝑘k — any non-negative integer).

For example, let the item have a value of 178178-bourles. Then the new price of the item will be 100100, and the answer will be 178100=78178−100=78.

Input

The first line of input data contains a single integer 𝑡t (1𝑡1041≤t≤104) — the number of test cases .

Each test case is a string containing a single integer 𝑚m (1𝑚1091≤m≤109) — the price of the item.

## [Solution] Round Down the Price solution codeforces

For each test case, output on a separate line a single integer 𝑑d (0𝑑<𝑚0≤d<m) such that if you reduce the cost of the item by 𝑑d bourles, the cost of the item will be the maximal possible round number. More formally: 𝑚𝑑=10𝑘m−d=10k, where 𝑘k — the maximum possible non-negative integer.

Example
input

Copy
7
1
2
178
20
999999999
9000
987654321

output

Copy
0
1
78
10
899999999
8000
887654321


## [Solution] Round Down the Price solution codeforces

In the example:

• 10=1001−0=100,
• 21=1002−1=100,
• 17878=102178−78=102,
• 2010=10120−10=101,
• 999999999899999999=108999999999−899999999=108,
• 90008000=1039000−8000=103,
• 987654321887654321=108987654321−887654321=108.

Note that in each test case, we get the maximum possible round number.