#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    string s, strs[50];
    int w[50] {};
    int i, si = 0;
    bool wara = false;
    cin >> s;
    rep (i, s.size()/3) {
        if (s.compare(i*3,3,"ｗ") == 0) {
            wara = true;
            w[si]++;
        }
        else {
            if (wara) si++;
            wara = false;
            strs[si] += s.substr(i*3,3);
        }
    }
    int mx = *max_element(w,w+50);
    if (mx == 0)
        cout << endl;
    else {
        rep (i,51) {
            if (w[i] == mx && strs[i] != "")
                cout << strs[i] << endl;
        }
    }
    return 0;
}