#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>

#define rep(i,N) for(int (i)=0;(i)<(N);(i)++)
#define MOD 1000000007

using namespace std;

int powmod(int a, int b, int p) {
	if (b == 0)return 1;
	else if (b % 2 == 0)return (powmod(a*a, b / 2, p) % p);
	else return (powmod(a, b - 1, p)*a%p);
}

int factorialmod(int a, int p) {
	if (!a)return 1;
	else return a * factorialmod(a - 1, p) % p;
}

int main(){
	string s;
	cin >> s;
	int N = s.size();
	vector<double> p(N);
	vector<int> a(N,0);
	if (s[0] == 'o')a[0] = 1;
	for (int i = 1; i < N; i++) {
		a[i] = a[i - 1];
		if (s[i] == 'o')a[i]++;
	}
	p[0] = (double)a[N - 1] / (double)N * 100;
	for (int i = 0; i < N - 1; i++)p[i + 1] = (double)(a[N - 1] - a[i]) / (double)(N - i - 1) * 100;
	rep(i, N)printf("%10.8lf\n", p[i]);
	return 0;
}