求调

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<list> 
#include<queue>
using namespace std;
const double pi = 3.1415926535897932385;
typedef long long ll;
typedef pair<int,int> Pr;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}, eps=2e4+10, maxn=1e6+10;
template <typename T> inline void read(T &x) {
	x = 0;
	bool flag = false;
	char ch = getchar();
	while (ch < '0' || ch > '9') flag = ch == '-' ? true : false, ch = getchar();
	while (ch >= '0' && ch <= '9') x = (x << 3) + (x << 1) + (ch & 15), ch = getchar();
	if(flag) x = -x;
}
template <typename T> inline void write(T x) {
	if(x<0) {
		putchar('-');
		x = -x;
	}
	if(x>9) write(x / 10);
	putchar(x % 10 + '0');
}
ll t, n;
ll n1;
int main() {
    read(t);
    while(t--){
    	ll ans_0 = 0;
    	ll ans_9 = 0;
    	ll cnt = 0;
    	ll m = 0;
    	read(n);
    	if(n == 0){
    		printf("1");
    		continue;
		}
		n1 = n;
    	while(n != 0){
    		ll x = n % 10;
    		cnt += x;
    		if(x == 0){
    			ans_0++;
			}
			if(x == 9){
				ans_9++;
			}
			n /= 10;
			m++;
		}
		printf("%lld\n", (cnt + ans_0 * 8 + (m - ans_0 - ans_9)));
	}
	return 0;
}