#include <bits/stdc++.h>

// #include <atcoder/fenwicktree.hpp>
// #include <atcoder/segtree.hpp>
// #include <atcoder/modint.hpp>
// #include <atcoder/dsu.hpp>
// #include <atcoder/lazysegtree.hpp>

// using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
// using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	ll t;
	cin >> t;
	rep(_, t)
	{
		ll n;
		cin >> n;
		ll ans = 0;
		bool p = true;
		string s;
		cin >> s;
		rep(i, n)
		{
			bool np = p;
			if (s[i] == '-')
			{
				if (p)
				{
					ans += 9;
				}
				p = false;
				continue;
			}
			else if (s[i] == '+')
			{
				if (p)
				{
					ans += 9;
				}
				p = true;
				continue;
			}
			else if (s[i] == '*')
			{
				if (p)
				{
					ans += 9;
				}
				continue;
			}
			ll a = s[i] - '0';
			if (0 < a && a < 10)
			{
				if (p)
					ans += 9 - a;
				else
					ans += a - 1;
			}
			p = np;
		}
		cout << ans << endl;
	}
	return 0;
}