#include <stdio.h>
#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}

//667
void solve() {
	int len, oc = 0, xc = 0;
	char s[100001];
	scanf("%s", s);
	for (len = 0; s[len] != 0; len++)
		(s[len] == 'o' ? oc : xc)++;
	for (int i = 0; i < len; i++) {
		printf("%.13lf\n", (double)oc / (double)(oc + xc) * 100.);
		(s[i] == 'o' ? oc : xc)--;
	}
}