#include <bits/stdc++.h>

using i64 = long long;

constexpr int cost[16] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6, 6, 5, 4, 5, 5, 4};
int pre[17];

i64 get(i64 n) {
    if (n == (1LL << 32)) {
        return pre[16] * (1LL << 28) * 8;
    }
    i64 ans = 0;
    int s = 0;
    for (int i = 7; i >= 0; i--) {
        int d = n >> (4 * i) & 15;
        ans += pre[d] * (1LL << (4 * i));
        ans += 1LL * s * d * (1LL << (4 * i));
        if (i) {
            ans += 1LL * pre[16] * d * (1LL << (4 * i - 4)) * i;
        }
        s += cost[d];
    }
    return ans;
}

void solve() {
    int n;
    std::cin >> n;
    
    std::string s;
    std::cin >> s;
    
    i64 a = 0;
    for (int i = 0; i < 8; i++) {
        a *= 16;
        if (std::isdigit(s[i])) {
            a += s[i] - '0';
        } else {
            a += s[i] - 'A' + 10;
        }
    }
    
    i64 ans = 0;
    i64 l = a, r = l + n;
    if (r <= (1LL << 32)) {
        ans += get(r);
    } else {
        ans += get(r - (1LL << 32));
        ans += get(1LL << 32);
    }
    ans -= get(l);
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    for (int i = 0; i < 16; i++) {
        pre[i + 1] = pre[i] + cost[i];
    }
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}