#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++)
#define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++)
#define all(n) (n).begin(),(n).end()
typedef long long ll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<long long,long long> Pii;
typedef vector<Pii> VPii;

int C[] = {1,5,10,50,100,500};


int mod = 1e9 + 9;
unordered_map<long long,int> dp[62][6];

int dfs(int level,int stage,long long remain){
	if( remain < 0 ) return 0;
	if( stage == 6 ) level++, stage = 0;
	if( level == 62 ) return (remain == 0);
	if( dp[level][stage].count(remain) ) return dp[level][stage][remain];
	if( remain & ((1ll<<level)-1) ) return 0;
	int ans = dfs(level,stage+1,remain);
	if( (double)(1ll<<level) * C[stage] < 2e18 ){
		ans += dfs(level,stage+1,remain - (1ll<<level) * C[stage]);
	}
	if( ans >= mod ) ans -= mod;
	return dp[level][stage][remain] = ans;	
	
}
int main(){
	int T;
	cin >> T;
	while(T--){
		rep(i,62)rep(j,5) dp[i][j].clear();
		long long M;
		cin >> M;
		cout << dfs(0,0,M) << endl;
	}

	
	
}