数位DP详见:http://blog.csdn.net/u014609452/article/details/52598675
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(ll &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
int a[25],len; ll n;
ll dp[25][3];
ll ans;
int main(){
ll Q; int flag=0;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(Q);
while (Q--){
read(n); n++;
len=0;
while (n) a[++len]=n%10,n/=10;
reverse(a+1,a+len+1);
flag=0; cl(dp);
for (int i=1;i<=len;i++){
dp[i][0]+=dp[i-1][0]*9+dp[i-1][1]*8;
dp[i][1]+=dp[i-1][0]+dp[i-1][1];
dp[i][2]+=dp[i-1][1]+dp[i-1][2]*10;
if (flag){
dp[i][2]+=a[i];
}else{
if (a[i]<=4)
dp[i][0]+=a[i];
if (a[i]>4){
dp[i][0]+=a[i]-1;
dp[i][1]++;
}
}
if (a[i]==9 && a[i-1]==4) flag=1;
}
ans=dp[len][2];
printf("%lld\n",ans);
}
return 0;
}