#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

string s;
int main(){
    cin>>s;
    double maru=0;
    double batu=0;
    REP(i,0,s.size()){
        if(s[i]=='o') maru++;
        else batu++;
    }
    REP(i,0,s.size()){
        printf("%.7lf\n", 100*maru/(maru+batu));
        if(s[i]=='o') maru--;
        else batu--;
    }
    return 0;
}