1 #include<bits/stdc++.h>
 2 using namespace std;
 3 #define ll long long
 4 ll a[1000009];
 5 ll dp[20][2];
 6 ll dfs(ll pos,ll num,bool limit)///num为上一位是否是4
 7 {
 8     if(!limit&&dp[pos][num]!=-1) return dp[pos][num];
 9     if(pos==0) return 1;
10     ll up=limit?a[pos]:9;
11     ll res=0;
12     for(ll i=0;i<=up;i++)
13     {
14         if(i==9&&num) continue;
15         res+=dfs(pos-1,i==4,limit&&i==a[pos]);
16     }
17     if(!limit) dp[pos][num]=res;
18     return res;
19 }
20 ll solve(ll x)
21 {
22     ll pos=0;
23     while(x)
24     {
25         a[++pos]=x%10;
26         x/=10;
27     }
28     return dfs(pos,0,1);
29 }
30 int main()
31 {
32     memset(dp,-1,sizeof(dp));
33     ll a,t;
34     scanf("%lld",&t);
35     while(t--)
36     {
37         scanf("%lld",&a);
38         printf("%lld\n",a+1-solve(a));
39     }
40     return 0;
41 }