/*
    AUTHOR:hruday pabbisetty
    NIT ROURKElA
*/
#include <bits/stdc++.h>
#include <tr1/unordered_map>
using namespace std;
using namespace std::tr1;
#define opt ios_base::sync_with_stdio(0)
#define lli long long int
#define ulli unsigned long long int
#define I int
#define S string
#define D double
#define rep(i,a,b) for(i=a;i<b;i++)
#define repr(i,a,b) for(i=a;i>b;i--)
#define in(n) scanf("%lld",&n)
#define in2(a,b) scanf("%lld %lld",&a,&b)
#define in3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define out(n) printf("%lld\n",n)
#define inu(a) scanf("%lld",&a)
#define outu(a) printf("%llu",a)
#define ins(s) scanf("%s",&s)
#define outs(s) printf("%s",s)
#define mod 1000000007
#define inf 100000000000000
typedef long long       ll;
typedef pair<lli,lli>  plli;
typedef vector<lli>     vlli;
typedef vector<ulli>    vulli;
typedef vector<ll>      vll;
typedef vector<string>  vs;
typedef vector<plli>     vplli;
#define MM(a,x)  memset(a,x,sizeof(a));
#define ALL(x)   (x).begin(), (x).end()
#define P(x)       cerr<<"{"#x<<" = "<<(x)<<"}"<<endl;
#define P2(x,y)       cerr<<"{"#x" = "<<(x)<<", "#y" = "<<(y)<<"}"<<endl;
#define P3(x,y,z)  cerr<<"{"#x" = "<<(x)<<", "#y" = "<<(y)<<", "#z" = "<<(z)<<"}"<<endl;
#define P4(x,y,z,w)cerr<<"{"#x" = "<<(x)<<", "#y" = "<<(y)<<", "#z" = "<<(z)<<", "#w" = "<<(w)<<"}"<<endl;
#define PP(x,i)     cerr<<"{"#x"["<<i<<"] = "<<x[i]<<"}"<<endl;
#define TM(a,b)     cerr<<"{"#a" -> "#b": "<<1000*(b-a)/CLOCKS_PER_SEC<<"ms}\n";
#define UN(v)    sort(ALL(v)), v.resize(unique(ALL(v))-v.begin())
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define sz() size()
#define nl cout<<"\n"
#define MX1 100005
#define MX2 1000005
#define bs binary_search
#define lb lower_bound
#define ub upper_bound
lli dx[]={0,0,-1,1};
lli dy[]={1,-1,0,0};
lli power(lli a,lli b)
    {
    lli value;
    if(b==0)
        {
        return 1;
    }
    else if(b%2==0)
        {
        value=power(a,b/2)%mod;
        return(value*value)%mod;
    }
    else
        {
        value=power(a,b/2)%mod;
        return ((a*value)%mod*(value))%mod;
    }
}
lli ans[1000005],diamonds[2000005],prefix_diamonds[2000005];
lli diamonds_in_room(lli n)
{
    lli a[2]={0};
    while(n)
    {
        a[n%2]+=n%10;
        n/=10;
    }
    return abs(a[0]-a[1]);
}
int main()
{
        #ifndef ONLINE_JUDGE
        freopen("input5.txt","r",stdin);
        freopen("output5.txt","w",stdout);
        #endif*/
    opt;
    lli i;
    rep(i,2,2000001)
    {
        diamonds[i]=diamonds_in_room(i);//stores the diamonds present in room with number i
    }
    rep(i,2,2000001)
    {
        prefix_diamonds[i]=prefix_diamonds[i-1]+diamonds[i];//stores the sum of diamonds present in all the rooms with number less than or equal to i
    }
    rep(i,1,1000001)
    {
        ans[i]=ans[i-1];
        ans[i]+=2*(prefix_diamonds[2*i-1]-prefix_diamonds[i]);//calculating answer for i from i-1 using the recurrence relation.
        ans[i]+=diamonds[2*i];
    }
    lli t;
    cin>>t;
    while(t--)
    {
        lli n;
        cin>>n;
        cout<<ans[n]<<endl;
    }
}