#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
__int128 p9[25],f[25],suf[25];
__int128 n;
char s[105];
unordered_map<__int128,__int128,hash<ll>>mp[25][25];
__int128 dfs(int d,__int128 p,int z,int lim){
	// printf("dfs %d %d %d %d\n",d,(int)p,z,lim);
	if(d>=lim)return p>=f[lim];
	if(p>=f[lim])return z==1?suf[d]:p9[lim-d];
	if(p*p9[lim-d]<f[lim])return 0;
	if(z==0 && mp[lim][d].find(p)!=mp[lim][d].end())return mp[lim][d][p];
	__int128 sum=0;
	int top=z==1?(s[d]-'0'):9;
	for(int i=1;i<=top;i++)sum+=dfs(d+1,p*i,z&(i==top),lim);
	if(z==0)mp[lim][d][p]=sum;
	// printf("(%d,%d,%d,%d) ans=%d\n",d,(int)p,z,lim,(int)sum);
	return sum;
}
namespace IO{
	int read(){
		int x=0,c=getchar(),f=1;
		while(c<'0' || c>'9'){
			if(c=='-')f=-1;
			c=getchar();
		}
		while(c>='0' && c<='9'){
			x=(x<<3)+(x<<1)+c-'0';
			c=getchar();
		}
		return f==1?x:-x;
	}
	void write(__int128 x){
		if(x<0){
			putchar('-');
			write(-x);
			return;
		}
		if(x>9)write(x/10);
		putchar(x%10+48);
	}
	void write(__int128 x,char div){
		write(x);
		putchar(div);
	}
	void write(const char *s){
		int pos=0;
		while(s[pos])putchar(s[pos++]);
	}
}
using namespace IO;
int main(){
	f[0]=p9[0]=1;
	for(int i=1;i<=23;i++){
		f[i]=f[i-1]*i;
		p9[i]=p9[i-1]*9;
	}
	int T=read();
	while(T--){
		scanf("%s",s);
		__int128 ans=0;
		if(strlen(s)>=22){
			for(int i=1;i<=22;i++)ans+=dfs(0,1,0,i);
		}
		else{
			int len=strlen(s);
			suf[len]=1;
			for(int i=len-1;i>=0;i--)suf[i]=max((__int128)0,suf[i+1]+(s[i]-'1')*p9[len-1-i]);
			// for(int i=0;i<len;i++)write(suf[i],32);
			// write("\n");
			for(int i=1;i<len;i++)ans+=dfs(0,1,0,i);
			// write(ans,10);
			// write("*******\n");
			ans+=dfs(0,1,1,len);
		}
		write(ans,10);
	}
	return 0;
}
//quod erat demonstrandum
//爆搜！爆搜！根本卡不掉！爆搜！爆搜！