// clang-format off
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <bitset>
#include <vector>
#include <algorithm>
#include <random>
#include <map>
#include <string>
#include <set>
#include <deque>
#include <cassert>

const int N = 3e5 + 7, A = 26, C = 2, MOD = 1e9+7;
using namespace std;
int n;

string s;

signed main() {
#ifdef _DEBUG
    freopen("input.txt", "r", stdin);
#else
    std::ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    //freopen("input.txt", "r", stdin);
    cin >> s;
    n = s.size();
    long long answ = 1e18;
    if(n % 2 == 0){
    for(int i = 0; i < n; i++){
        long long t_ans = 0;
        int cnt = 0, i1 = i;
        for(int j = 0; j < n/2; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1++;
            if(i1 == n){
                i1 = 0;
            }
        }
        cnt = 0; i1 = i-1;
        if(i1 == -1){
            i1 = n-1;
        }
        for(int j = 0; j < n/2; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1--;
            if(i1 == -1){
                i1 = n-1;
            }
        }
        answ = min(answ, t_ans);
    }

    }else{
        for(int i = 0; i < n; i++){
        long long t_ans = 0;
        int cnt = 0, i1 = i;
        for(int j = 0; j < n/2+1; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1++;
            if(i1 == n){
                i1 = 0;
            }
        }
        cnt = 0; i1 = i-1;
        if(i1 == -1){
            i1 = n-1;
        }
        for(int j = 0; j < n/2; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1--;
            if(i1 == -1){
                i1 = n-1;
            }
        }
        answ = min(answ, t_ans);

        t_ans = 0;
        cnt = 0; i1 = i;
        for(int j = 0; j < n/2; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1++;
            if(i1 == n){
                i1 = 0;
            }
        }
        cnt = 0; i1 = i-1;
        if(i1 == -1){
            i1 = n-1;
        }
        for(int j = 0; j < n/2 + 1; j++){
            if(s[i1] == '*'){
                t_ans += j-cnt;
                cnt++;
            }
            i1--;
            if(i1 == -1){
                i1 = n-1;
            }
        }
        answ = min(answ, t_ans);
        }
    }
    cout << answ;
}