#include<algorithm>
#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

int main(){
  string s;
  cin>>s;
  int n=s.length();
  vector<double>ans(n);
  int a=0,b=0;
  rep(i,n){
    if(s[n-1-i]=='o')a++;
    else b++;
    ans[n-1-i]=(double)a/(a+b);
  }
  rep(i,n)printf("%.15f\n",100*ans[i]);
}