#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

vector<vector<mint>> a;

void solve(){
	long long M;
	cin>>M;
	
	vector<mint> dp(22,0);
	dp[0] = 1;
	int c = 0;
	while(M!=0){
		vector<mint> ndp(22,0);
		
		rep(i,22){
			if(dp[i]==0)continue;
			rep(j,a[c].size()){
				if((i+j)%10!=M%10)continue;
				ndp[(i+j)/10] += dp[i] * a[c][j];
			}
		}
		
		c = min(c+1,2);
		swap(dp,ndp);
		
		M/=10;
	}
	
	cout<<dp[0].val()<<endl;	
}

int main(){
	
	mint::set_mod(1000000009);
	a.resize(3);
	a[0].resize(55,0);
	rep(i,10){
		rep(j,10){
			a[0][i+j*5] ++;
		}
	}
	
	a[1].resize(109,0);
	rep(i,55){
		rep(j,55){
			a[1][i+j] += a[0][i] * a[0][j];
		}
	}
	
	//cout<<a[0][10].val()<<endl;
	
	a[2].resize(108 + 54 + 1,0);
	rep(i,109){
		rep(j,55){
			a[2][i+j] += a[0][j] * a[1][i];
		}
	}
	
	int _t;
	cin>>_t;
	
	rep(_,_t)solve();
	
	return 0;
}