#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s; cin >> s;
    while(s.size()){
        if(isalnum(s[0]))break;
        string t = s.substr(0,3);
        if(t == "ｗ"){
            s = s.substr(3);
        }
        else break;
    }
    if(s.size() == 0){
        return 0;
    }
    vector<pair<string,int>> v;
    for(int i=0;i<s.size();i++){
        string t = "";
        if(isalnum(s[i])){
            t += s[i];
        }
        else{
            t += s[i]; i++;
            t += s[i]; i++;
            t += s[i];
        }
        if(t == "ｗ"){
            v.back().second++;
        }
        else{
            if(!v.size() or v.back().second > 0){
                v.push_back({t,0});
            }
            else{
                v.back().first += t;
            }
        }
    }
    int mx = 0;
    for(auto p:v){
        mx = max(mx, p.second);
    }
    if(mx == 0){
        return 0;
    }
    for(auto p:v){
        if(p.second == mx){
            cout << p.first << endl;
        }
    }
}