#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = (ll)s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define TT template <typename T>
template <class T1, class T2>
bool chmin(T1& x, T2 y) { return x > y ? (x = y, true) : false; }
template <class T1, class T2>
bool chmax(T1& x, T2 y) { return x < y ? (x = y, true) : false; }

struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
        srand(time(NULL));
    }
} io_setup;

void solve() {
    int N;
    string F;
    cin >> N >> F;
    F = '+' + F;
    N++;
    bool is_plus = true;
    ll ans = 0;
    rep(i, 1, N) {
        if (F[i] == '+') {
            if (is_plus) ans += 9;
            is_plus = true;
        } else if (F[i] == '-') {
            if (is_plus) ans += 9;
            is_plus = false;
        } else if (F[i] == '*'){
            if (is_plus) ans += 9;
        } else {
            if (is_plus) ans += '9' - F[i];
            else ans += F[i] - '1';
        }
    }
    cout << ans << "\n";
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
}