#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <queue>

using namespace std;

int main() {
    string input;
    getline(cin, input);

    unordered_map<string, int> sti;
    vector<pair<int, pair<int, int>>> blocks;
    for (int i = 0, l = -1; i < input.size(); ++i) {
        char c = input[i];
        if (c >= 'a' && c <= 'z') {
            if (l == -1) l = i;
        } else {
            if (l >= 0) {
                string ss = input.substr(l, i - l);
                int id;
                if (sti.count(ss)) {
                    id = sti[ss];
                } else {
                    id = sti.size();
                }
                sti[ss] = id;
                blocks.push_back({id, {l, i}});
                l = -1;
            }
        }
    }

//    for (const auto& p : sti) cout << p.first << " : " << p.second << endl;

    int n = sti.size();
    unordered_set<int> graph[n * 2];
    bool colored[n * 2];
    fill(colored, colored + n * 2, false);
    for (int i = 1; i < blocks.size(); ++i) {
        if (blocks[i].second.first - blocks[i-1].second.second == 1) {
            graph[blocks[i-1].first * 2 + 1].insert(blocks[i].first * 2);
            graph[blocks[i].first * 2].insert(blocks[i-1].first * 2 + 1);
        } else if (input[blocks[i-1].second.second] == ',') {
            colored[blocks[i-1].first * 2 + 1] = true;
            colored[blocks[i].first * 2] = true;
        }
    }

//    for (int x = 0; x < n * 2; ++x) {
//        cout << x << " : ";
//        for (const int& y : graph[x]) {
//            cout << y << ",";
//        }
//        cout << endl;
//    }

    queue<int> q;
    for (int i = 0; i < n * 2; ++i) {
        if (colored[i]) {
            q.push(i);
        }
    }
    fill(colored, colored + n * 2, false);
    while (!q.empty()) {
        int v = q.front(); q.pop();
        if (colored[v]) continue;
        colored[v] = true;
        for (const int& ne : graph[v]) {
            if (colored[ne]) continue;
            q.push(ne);
        }
    }

    for (int i = 0; i < blocks.size(); ++i) {
        cout << input.substr(blocks[i].second.first, blocks[i].second.second - blocks[i].second.first);
        if (i == blocks.size() - 1) {
            cout << input.substr(blocks[i].second.second);
        } else if (blocks[i + 1].second.first - blocks[i].second.second > 1 || !colored[blocks[i].first * 2 + 1]) {
            cout << input.substr(blocks[i].second.second, blocks[i + 1].second.first - blocks[i].second.second);
        } else {
            cout << ", ";
        }
    }
    cout << endl;

    return 0;
}