#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define int long long
#ifdef int
const long long INF = LLONG_MAX / 10;
#else
const int INF = 1010101010;
#endif
using namespace std;
typedef long long ll;
typedef vector<vector<ll> > mat;
typedef pair<int, int> P;
//typedef pair<double, double> P;
const int dx[9] = {-1, 0, 0, 1, -1, -1, 1, 1, 0};
const int dy[9] = {0, -1, 1, 0, -1, 1, -1, 1, 0};
 
string S;
int ok, ng;
 
signed main()
{
  cin >> S;
  REP(i,S.length()) {
    if (S[i] == 'o') ok++;
    else ng++;
  }

  REP(i,S.length()) {
    printf("%.10lf\n", 100.0 * ok / (ok + ng));
    if (S[i] == 'o') ok--;
    else ng--;
  }
}