#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_map>

using namespace std;

#define ll long long
#define all(v) v.begin(),v.end()
#define bootstrap ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);


void solve() {
    string boxes;
    cin >> boxes;
    double o, x = 0;
    for (char &ch:boxes) {
        if (ch == 'x') {
            x++;
        }
    }
    o = boxes.length() - x;
    for (int i = 0; i < boxes.length() - 1; ++i) {
        cout << o / (x + o) << endl;
        if(boxes.at(i) == 'o') {
            o --;
        } else {
            x --;
        }
    }

}

int main() {
    bootstrap;
    int t;
    t = 1;//cin>>t;
    solve();
}