#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
 
using namespace std;
 
int main() {
    string s;
    getline(cin, s);
 
    map<char, size_t> frequency;
 
    for(auto c: s)
        ++frequency[c];
 
    using P = pair<char, size_t>;
    vector<P> v(frequency.begin(), frequency.end());
    sort(v.begin(), v.end(), [] (P largest, P x) {
        return largest.second > x.second;
    });
 
    printf("(%c) (%c) (%c)", v[0].first, v[1].first, v[2].first);
 
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWFwPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgc3RyaW5nIHM7CiAgICBnZXRsaW5lKGNpbiwgcyk7CiAgICAKICAgIG1hcDxjaGFyLCBzaXplX3Q+IGZyZXF1ZW5jeTsKICAgIAogICAgZm9yKGF1dG8gYzogcykKICAgICAgICArK2ZyZXF1ZW5jeVtjXTsKICAgIAogICAgdXNpbmcgUCA9IHBhaXI8Y2hhciwgc2l6ZV90PjsKICAgIHZlY3RvcjxQPiB2KGZyZXF1ZW5jeS5iZWdpbigpLCBmcmVxdWVuY3kuZW5kKCkpOwogICAgc29ydCh2LmJlZ2luKCksIHYuZW5kKCksIFtdIChQIGxhcmdlc3QsIFAgeCkgewogICAgICAgIHJldHVybiBsYXJnZXN0LnNlY29uZCA+IHguc2Vjb25kOwogICAgfSk7CiAgICAKICAgIHByaW50ZigiKCVjKSAoJWMpICglYykiLCB2WzBdLmZpcnN0LCB2WzFdLmZpcnN0LCB2WzJdLmZpcnN0KTsKICAgIAogICAgcmV0dXJuIDA7Cn0=

YWFiYmJiY2NjZGQ=

aabbbbcccdd