hdu 3555(counting)

#include <utility>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#include <bitset>
#include <map>
#include <iterator>
using namespace std;
#define clr(a,v) memset(a,v,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x7f7f7f7f;
const int maxn = 211111;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int mod = 777777777;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
LL dp[25][25];
int d[25];
LL dfs(int pos,int have,bool doing)
{
	if(pos<0)
		return have==2;
	if(!doing&&dp[pos][have]!=-1)
		return dp[pos][have];
	int end=doing?d[pos]:9;
	LL ans=0;
	for(int i=0;i<=end;++i)
	{
		int nhave=have;
		if(have==1&&i==9)
			nhave=2;
		else if(have<2)
			nhave=(i==4);
		ans+=dfs(pos-1,nhave,doing&&i==end);
	}
	if(!doing)
		dp[pos][have]=ans;
	return ans;
}
LL cal(LL n)
{
	int cnt=0;
	while(n)
	{
		d[cnt++]=n%10;
		n/=10;
	}
	return dfs(cnt-1,0,true);
}
int main() {
	memset(dp,-1,sizeof(dp));
	ios::sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--)
	{
		LL n;
		cin>>n;
		cout<<cal(n)<<endl;
	}
	return 0;
}