#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


template<typename T,T MOD = 1000000007>
struct Mint{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(int k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  Mint inv(){return pow(MOD-2);}
  
  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}
  
  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
};
//INSERT ABOVE HERE
using M = Mint<int, int(1e9+9)>;
const int MAX = 666 * 2 + 2;
M dp[MAX],nx[MAX];
signed main(){  
  vector<int> a({1,5,10,50,100,500});
  int n=a.size();

  int T;
  cin>>T;
  while(T--){
    Int m;
    cin>>m;
    for(int j=0;j<MAX;j++) dp[j]=nx[j]=M(0);
    dp[0]=M(1);
    while(m){
      for(int i=0;i<n;i++)
        for(int j=MAX;j>=0;j--)      
          if(j+a[i]<MAX) dp[j+a[i]]+=dp[j];
      
      for(int j=(m&1);j<MAX;j+=2) nx[j>>1]=dp[j];
      for(int j=0;j<MAX;j++) dp[j]=nx[j],nx[j]=M(0);
      m>>=1;
    }  
    cout<<dp[0].v<<endl;
  }
  return 0;
}