#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
  return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
vector<int> p;
char in[100000], *ch;
string A, B;
int main() {
  int n, T, t = 1, m, i, j, k;
  scanf("%s", in);
  ch = strtok(in, ":");
  A = ch;
  ch = strtok(NULL, ":");
  B = ch;
  int f = 0;
  for (i = 0; i < ((int)A.size()); i++) {
    if (A[i] != '0') break;
  }
  if (i == ((int)A.size()))
    f++;
  else if (i == ((int)A.size()) - 1) {
    if (A[i] - 'A' + 10 > 23) {
      puts("0");
      return 0;
    }
    f++;
  }
  for (i = 0; i < ((int)B.size()); i++) {
    if (B[i] != '0') break;
  }
  if (i == ((int)B.size()) || i == ((int)B.size()) - 1) f++;
  if (f == 2) {
    puts("-1");
    return 0;
  }
  int ans = 0;
  for (k = 2;; k++) {
    long long unsigned tot = 0;
    long long unsigned cur = 1;
    for (i = ((int)A.size()) - 1; i > -1; i--) {
      if (isalpha(A[i])) {
        tot += cur * (long long unsigned)(A[i] - 'A' + 10);
        j = A[i] - 'A' + 10;
      } else {
        tot += cur * (long long unsigned)(A[i] - '0');
        j = A[i] - '0';
      }
      if (j >= k) goto second;
      cur *= (long long unsigned)k;
    }
    if (tot > 23) break;
    tot = 0;
    cur = 1;
    for (i = ((int)B.size()) - 1; i > -1; i--) {
      if (isalpha(B[i])) {
        j = B[i] - 'A' + 10;
        tot += cur * (long long unsigned)(j);
      } else {
        j = B[i] - '0';
        tot += cur * (long long unsigned)(j);
      }
      if (j >= k) goto second;
      cur *= (long long unsigned)k;
    }
    if (tot > 59) break;
    ans++;
    p.push_back(k);
  second:;
  }
  if (ans == 0)
    puts("0");
  else {
    for (i = 0; i < ((int)p.size()); i++) {
      if (i) printf(" ");
      printf("%d", p[i]);
    }
    puts("");
  }
  return 0;
}
