#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 50;
int ge[maxn];
int ans[100] = { 1, 11, 55, 220, 715 };

int jia(int x) {
    int ans = 0;
    while (x) {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

void solve() {
    ll k;
    cin >> k;
    if (k <= 1) {
        cout << ans[k] << endl;
        return;
    }
    if (k > 90) {
        cout << 0 << endl;
        return;
    }
    ll an = 0;
    for (int i = 0; i <= k; i++) {
        an += ge[i] * ge[k - i];
    }
    cout << an << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // chu li
    for (int i = 0; i <= 99999; i++) {
        ge[jia(i)]++;
    }
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}