#include <bits/stdc++.h>
char s[100005], ch[100005], num[100005];
int chl, numl, Kong;
int kong;
void solve(int l, int r) {
  bool point = false, hasC = false;
  int hasN = 0, cm = -1;
  for (int i = l; i <= r; i++) {
    if (s[i] == '.') {
      point = true;
      break;
    } else if ((s[i] >= 'A' && s[i] <= 'Z') || (s[i] >= 'a' && s[i] <= 'z')) {
      hasC = true;
      break;
    } else if (s[i] >= '0' && s[i] <= '9') {
      hasN++;
      if (cm == -1) cm = i;
    }
  }
  if (s[cm] == '0' && hasN != 1) hasC = true;
  if (!hasN && !hasC && !point) {
    if (chl != 0 && ch[chl - 1] != ',') ch[chl++] = ',';
    Kong++;
    ch[chl++] = ',';
    kong = 1;
  } else if (point || hasC) {
    if (chl != 0 && !kong) ch[chl++] = ',';
    for (int i = l; i <= r; i++)
      if (s[i] != ',' && s[i] != ';') ch[chl++] = s[i];
    kong = 0;
  } else {
    if (numl != 0 && num[numl - 1] != ',') num[numl++] = ',';
    for (int i = l; i <= r; i++)
      if (s[i] != ',' && s[i] != ';') num[numl++] = s[i];
  }
}
int main() {
  int i, len, l, r;
  scanf("%s", s);
  len = strlen(s);
  l = r = 0;
  for (i = 0; i < len; i++) {
    if (s[i] == ',' || s[i] == ';' || i == len - 1) {
      r = i;
      solve(l, r);
      l = r;
    }
  }
  if (s[len - 1] == ',' || s[len - 1] == ';') {
    if (ch[chl - 1] != ',') ch[chl++] = ',';
  }
  ch[chl] = num[numl] = '\0';
  if (chl == 1 && ch[chl - 1] == ',' && len != 1) ch[chl - 1] = '\0';
  if (numl == 0)
    puts("-");
  else
    printf("%c%s%c\n", '"', num, '"');
  if (chl == 0)
    puts("-");
  else
    printf("%c%s%c\n", '"', ch, '"');
}
