#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<int>> a(2);

void solve(){
	long long M;
	cin>>M;
	
	vector<mint> dp(666,0);
	dp[0] = 1;
	
	while(M!=0){
		vector<mint> ndp(666,0);
		rep(i,666){
			if(dp[i]==0)continue;
			rep(j,a[(M^i)&1].size()){
				ndp[(i + a[(M^i)&1][j])>>1] += dp[i];
			}
		}
		swap(dp,ndp);
		M>>=1;
	}
	
	cout<<dp[0].val()<<endl;	
}

int main(){
	
	vector<int> t = {1,5,10,50,100,500};
	int c = 0;
	rep(i,1<<t.size()){
		int s = 0;
		rep(j,t.size()){
			if((i>>j)&1)s += t[j];
		}
		a[s%2].push_back(s);
	}
	//cout<<c<<endl;
	
	mint::set_mod(1000000009);
	
	int _t;
	cin>>_t;
	
	rep(_,_t)solve();
	
	return 0;
}