#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define ll __int128
#define int __int128
using namespace std;
ll n, ans, p, b[1000006], ccnt, c[1000006], t, a[30], jie[30], m, sum, op;
map<ll, ll> ma;
vector<pair<ll, ll>> v[30];
string s;
inline ll read() {
	ll x = 0, t = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			t = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * t;
}
inline void write(ll x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}
signed main() {
	jie[0] = 1;
	for (int i = 1; i <= 21; i++) {
		jie[i] = jie[i - 1] * i;
	}
	p = 1;
	for (int i = 1; i <= 9; i++) {
		v[1].push_back(make_pair(i, 1));
	}
	for (int i = 1; i <= 20; i++) {
		ma.clear();
		for (int j = 1; j <= ccnt; j++) b[j] = 0;
		ccnt = 0;
		for (int j = 0; j < v[i].size(); j++) {
			for (int k = 0; k <= 9; k++) {
				if (!ma[v[i][j].first * k]) ma[v[i][j].first * k] = ++ccnt, c[ccnt] = v[i][j].first * k;
				b[ma[v[i][j].first * k]] += v[i][j].second;
			}
		}
		for (int j = 1; j <= ccnt; j++) {
			v[i + 1].push_back(make_pair(c[j], b[j]));
		}
		sort(v[i + 1].begin(), v[i + 1].end());
	}
	for (int i = 1; i <= 21; i++) {
		for (int j = v[i].size() - 2; j >= 0; j--) {
			v[i][j].second += v[i][j + 1].second;
//			if (i == 4) {
//				write(v[i][j].first);
//				cout << ' ';
//				write(v[i][j].second);
//				cout << "||";
//			}
		}
//		cout << '\n';
	}
	t = read();
	v[0].push_back(make_pair(1, 1));
//	cout << "|";
//	write(t);
//	cout << "|";
	while (t--) {
		sum = 1;
		cin >> s;
		if (s.size() > 21) {
			for (int i = 1; i <= 21; i++) {
				a[i] = 9;
				sum *= 9;
			}
			m = 21;
		} else {
			for (int i = s.size(); i >= 1; i--) {
				a[i] = s[s.size() - i] - '0';
//				write(a[i]);
				sum *= s[s.size() - i] - '0';
			}
			m = s.size();
		}
		ans = 0;
		for (int i = 1; i < m; i++) {
			ans += v[i][lower_bound(v[i].begin(), v[i].end(), make_pair(jie[i], (ll) - 1)) - v[i].begin()].second;
		}
		ll cnt = 1;
		for (int i = m; i >= 1; i--) {
//			write(a[i]);
//			cout << ' ';
			for (int j = 1; j < a[i]; j++) {
//				write(v[i - 1][lower_bound(v[i - 1].begin(), v[i - 1].end(), make_pair((jie[m] - 1) / (cnt * j) + 1, (ll) - 1)) - v[i - 1].begin()].second);
//				cout << "|";
//				write(lower_bound(v[i - 1].begin(), v[i - 1].end(), make_pair((jie[m] - 1) / (cnt * j) + 1, (ll) - 1)) - v[i - 1].begin());
//				cout << "**";
//				write((jie[m] - 1) / (cnt * j) + 1);
//				cout << "%%";
				op = lower_bound(v[i - 1].begin(), v[i - 1].end(), make_pair((jie[m] - 1) / (cnt * j) + 1, (ll) - 1)) - v[i - 1].begin();
				if (op < v[i - 1].size()) {
					ans += v[i - 1][op].second;
				}

			}
			cnt *= a[i];
			if (!cnt) break;
		}
		if (sum >= jie[m]) ans++;
		write(ans);
		cout << "\n";
	}

}