M. Sum of 2050

M. Sum of 2050、

水题，让我看看是哪个小可爱不会做

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A number is called 2050-number if it is 2050, 20500, …, (2050⋅10^k for integer k≥0).

Given a number n, you are asked to represent n as the sum of some (not necessarily distinct) 2050-numbers. Compute the minimum number of 2050-numbers required for that.

Input

The first line contains a single integer T (1≤T≤1000) denoting the number of test cases.

The only line of each test case contains a single integer n (1≤n≤10¹⁸) denoting the number to be represented.

Output

For each test case, output the minimum number of 2050-numbers in one line.

If n cannot be represented as the sum of 2050-numbers, output −1 instead.

Example

input

6
205
2050
4100
20500
22550
25308639900

output

-1
1
2
1
2
36

Note

In the third case, 4100=2050+2050.

In the fifth case, 22550=20500+2050.

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll t;
ll n, ans;

ll qiuweishu(ll x)
{
	ll sum = 0;
	while(x)
	{
		sum += (x % 10);
		x /= 10;
	} 
	return sum;
}


int main()
{
	cin >> t;
	for (int i = 1; i <= t; ++i)
	{
		cin >> n;
		ans = 0;
		ll temp;
		if(n % 2050 == 0){
			temp = n / 2050;
			ans = qiuweishu(temp);
			cout << ans << endl;
			continue;
		} 
		else cout << "-1" << endl;
	}
	
	return 0;
}