#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        string s;
        cin >> s;

        vector<string> a;

        for (int i = 0, j = 0; i <= int(s.size()); i++) {
            if (i == int(s.size()) || s[i] == '!') {
                a.push_back(s.substr(j, i - j));
                j = i + 1;
            }
        }

        auto same = [&](string s, string t) {
            if (s.size() != t.size()) {
                return false;
            }
            for (int i = 0; i < int(s.size()); i++) {
                if (tolower(s[i]) != tolower(t[i])) {
                    return false;
                }
            }
            return true;
        };

        while (true) {
            bool found = false;
            for (int i = 0; i < int(a.size()); i++) {
                for (auto d : {1, 2}) {
                    if (i + d < int(a.size()) && same(a[i], a[i + d])) {
                        a.erase(a.begin() + i + 1, a.begin() + i + d + 1);
                        found = true;
                        break;
                    }
                }
            }
            if (!found) {
                break;
            }
        }

        for (int i = 0; i < int(a.size()); i++) {
            cout << a[i] << "!\n"[i + 1 == int(a.size())];
        }
    };

    solve();

    return 0;
}