AT_abc475_b.Change

In the Kingdom of AtCoder, three kinds of coins — $1$-yen coins, $10$-yen coins, and $100$-yen coins — and $1000$-yen bills are in circulation.

Takahashi made $N$ purchases, starting from a state where he had $10^{100}$ $1000$-yen bills and $0$ coins.

In the $i$-th purchase, he bought an item worth $A_i$ yen.
For the payment, he paid using only the minimum number of $1000$-yen bills such that the total amount paid was at least $A_i$ yen, and received the change so that the total number of coins received as change was minimized.

Find the number of each type of coin that Takahashi has at the point when all $N$ purchases are finished.

在 AtCoder 王国，流通着三种硬币：1 日元硬币、10 日元硬币和 100 日元硬币，以及 1000 日元纸币。

高桥进行了 $N$ 次购物，初始状态为拥有 $10^{100}$ 张 1000 日元纸币，且没有硬币。

在第 $i$ 次购物中，他购买了一件价值 $A_i$ 日元的商品。
付款时，他仅使用最少张数的 1000 日元纸币，使得所付总额至少为 $A_i$ 日元；找零时，则使得作为找零收到的硬币总枚数最少。

求在完成全部 $N$ 次购物后，高桥所拥有的每种硬币的数量。

The input is given from Standard Input in the following format:

$N$
$A_1$ $\dots$ $A_N$

输入从标准输入中按以下格式给出：

$N$
$A_1$ $\dots$ $A_N$

Output the number of $1$-yen coins, $10$-yen coins, and $100$-yen coins that Takahashi has at the point when the $N$ purchases are finished, in this order, separated by spaces.

输出高桥在完成 $N$ 次购买后所拥有的 1 日元硬币、10 日元硬币和 100 日元硬币的数量，按此顺序以空格分隔。

Sample 1 Explanation:
In the first purchase, for the payment of $1296$ yen, Takahashi pays with two $1000$-yen bills, and receives seven $100$-yen coins and four $1$-yen coins as change.

In the second purchase, for the payment of $110$ yen, he pays with one $1000$-yen bill, and receives eight $100$-yen coins and nine $10$-yen coins as change.

In the third purchase, for the payment of $1$ yen, he pays with one $1000$-yen bill, and receives nine $100$-yen coins, nine $10$-yen coins, and nine $1$-yen coins as change.

At the point when the three purchases are finished, he has $13$ $1$-yen coins, $18$ $10$-yen coins, and $24$ $100$-yen coins.

Constraints

• $1\leq N \leq 1000$
• $1\leq A_i \leq 10^5$
• All input values are integers.

样例 1 解释：
第一次购物中，对于 $1296$ 日元的付款，高桥使用了两张 $1000$ 日元纸币支付，并收到七枚 $100$ 日元硬币和四枚 $1$ 日元硬币作为找零。

第二次购物中，对于 $110$ 日元的付款，他使用了一张 $1000$ 日元纸币支付，并收到八枚 $100$ 日元硬币和九枚 $10$ 日元硬币作为找零。

第三次购物中，对于 $1$ 日元的付款，他使用了一张 $1000$ 日元纸币支付，并收到九枚 $100$ 日元硬币、九枚 $10$ 日元硬币和九枚 $1$ 日元硬币作为找零。

当完成这三次购物后，他共持有 $13$ 枚 $1$ 日元硬币、$18$ 枚 $10$ 日元硬币和 $24$ 枚 $100$ 日元硬币。

限制条件

• $1\leq N \leq 1000$
• $1\leq A_i \leq 10^5$
• 所有输入值均为整数。