#include <bits/stdc++.h>
using namespace std;
long long get() {
  char c = getchar();
  long long x = 0LL;
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') {
    x *= 10LL;
    x += (c - '0');
    c = getchar();
  }
  return x;
}
string i_t_s(int x) {
  string t = "";
  while (x) {
    t += x % 10 + '0';
    x /= 10;
  }
  reverse(t.begin(), t.end());
  return t;
}
int s_t_i(string t) {
  int x = 0;
  for (int i = 0; i < (int)(t.size()); i++) {
    x = x * 10 + (t[i] - '0');
  }
  return x;
}
long long q_p(long long x, long long y) {
  long long res = 1;
  x %= 1000000007;
  while (y) {
    if (y % 2) {
      res = res * x;
      res %= 1000000007;
    }
    y /= 2;
    x = x * x;
    x %= 1000000007;
  }
  return res;
}
string s;
string ans1, ans2;
int main() {
  ios::sync_with_stdio(0);
  cin >> s;
  s += ';';
  ans1 += '"';
  ans2 += '"';
  int now = 0;
  while (now < (int)(s.size())) {
    if (s[now] == ';' || s[now] == ',') {
      ans2 += ',';
      now++;
      continue;
    }
    int nxt = now + 1;
    bool f = true;
    while (nxt < (int)(s.size()) && s[nxt] != ',' && s[nxt] != ';') nxt++;
    if (nxt - now > 1 && s[now] == '0') f = false;
    int nn = now;
    while (now < nxt) {
      if (!isdigit(s[now])) f = false;
      now++;
    }
    now++;
    if (f)
      ans1 += s.substr(nn, nxt - nn) + ',';
    else
      ans2 += s.substr(nn, nxt - nn) + ',';
  }
  if ((int)(ans1.size()) == 1)
    cout << "-\n";
  else {
    ans1[(int)(ans1.size()) - 1] = '"';
    cout << ans1 << "\n";
  }
  if ((int)(ans2.size()) == 1)
    cout << "-";
  else {
    ans2[(int)(ans2.size()) - 1] = '"';
    cout << ans2;
  }
  return 0;
}
