#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <unordered_map>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

unordered_map<int, int> used;

int recur(int x){
    if(used.find(x) != used.end()) return used[x];

    int ret = __builtin_popcount(x);

    for(int i = 0; i < 24; i++){
        if(((x >> i) & 7) == 3){
            ret = min(ret, recur(x - (3 << i) + (4 << i)));
        }
        if(((x >> i) & 7) == 6){
            ret = min(ret, recur(x - (6 << i) + (1 << i)));
        }
    }

    return used[x] = ret;
}

void answer(){
    int k;
    string s;
    cin >> k >> s;

    int n = 0;
    for(int i = 0; i < s.size(); i++) n = (n << 1) | (s[i] == '-');

    cout << k << " " << recur(n) << endl;
}

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

    int p;
    cin >> p;

    for(int i = 0; i < p; i++) answer();

    return 0;
}