#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

unordered_map<string, int> smp;
vector<string> ismp;
int get(const string &s) {
    auto it = smp.find(s);
    if (it != smp.end())
        return it->Y;
    int t = SZ(smp);
    smp[s] = t;
    ismp.pb(s);
    return t;
}

struct S {
    int idx;
    int com, per;
};

const int N = 1e6 + 6;
int pre[N], aft[N];
#define prev aaa
vector<int> prev[N], aftv[N];



int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    vector<S> v;
    string s;
    while (cin >> s) {
        S p = {0, 0, 0};
        if (s.back() == ',')
            p.com = 1, s.pop_back(); 
        else if (s.back() == '.')
            p.per = 1, s.pop_back();
        p.idx = get(s);
        v.pb(p);
    }
    queue<pii> q;
    auto mkpre = [&](int x) {
        if (pre[x]) return;
        pre[x] = 1;
        q.push({x, 0});
    };
    auto mkaft = [&](int x) {
        if (aft[x]) return;
        aft[x] = 1;
        q.push({x, 1});
    };
    for (int i = 0; i < SZ(v); i++) {
        if (i != 0 && !v[i - 1].per) {
            prev[v[i].idx].pb(v[i - 1].idx);
            if (v[i - 1].com)
                mkpre(v[i].idx);
        }
        if (i != SZ(v) - 1 && !v[i].per) {
            aftv[v[i].idx].pb(v[i + 1].idx);
            if (v[i].com)
                mkaft(v[i].idx);
        }
    }
    while (SZ(q)) {
        auto p = q.front(); q.pop();
        if (p.Y == 0) {
            // pre
            for (int t : prev[p.X])
                mkaft(t);
        }
        else {
            // aft 
            for (int t : aftv[p.X])
                mkpre(t);
        }
    }
    for (int i = 0; i < SZ(v); i++) {
        if (!v[i].per) {
            if (aft[v[i].idx] || (i + 1 < SZ(v) && pre[v[i + 1].idx]))
                v[i].com = 1;
        }
        cout << ismp[v[i].idx];
        if (v[i].com)
            cout << ",";
        else if (v[i].per)
            cout << ".";
        cout << " \n"[i + 1 == SZ(v)];
    }
}