#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b) {
    int x = 1;
    a %= M;
    while (b) {
        if (b & 1) x = (x * a) % M; 
        a = (a * a) % M;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

//* 2 ptr
int consistency1(int n){

    int total = 0;
    for(int i=0; i<n; i++){
        if(a[i] == '*') total++;
    }

    int mid = (total+1)/2;
    
    int median = 0;
    int ct = 0;
    for(int i=0; i<n; i++){
        if(a[i] == '*') ct++;
        if(ct == mid){
            median = i;
            break;
        }
    }


    int ans = 0;

    int empty = 0;
    for(int i=median-1; i>=0; i--){
        if(a[i] == '*'){
            ans += empty;
        }
        else empty++;
    }
    empty = 0;
    for(int i=median+1; i<n; i++){
        if(a[i] == '*') ans += empty;
        else empty++;
    }


    return ans;
}





//* Optimized prefix 
int consistency2(int n){

    vector<int> sheeps;
    int empty = 0;
    for(int i=0; i<n; i++){
        if(a[i] == '.') empty++;
        else sheeps.push_back(empty);
    }

    int total = sheeps.size();
    int median = (total-1)/2;

    int ans = 0;
    for(int i=0; i<total; i++){
        ans += abs(sheeps[i]-sheeps[median]);
    }


    return ans;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    cin >> a;

    cout << consistency1(n) << endl;
    // cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}