#include <bits/stdc++.h>
using namespace std;
long long int SOD(long long int n) {
  long long int sum = 0;
  while (n > 0) {
    sum = sum + n % 10;
    n /= 10;
  }
  return sum;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int pow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b % 2 == 1) res *= a;
    a *= a;
    b /= 2;
  }
  return res;
}
long long int powmod(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y % 2 == 1) res = (res * x) % p;
    y /= 2;
    x = (x * x) % p;
  }
  return res;
}
string dectobin(long long int x) {
  string s = "";
  while (x > 0) {
    long long int t = x % 2;
    s.push_back(t + '0');
    x /= 2;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long int bintodec(string s) {
  long long int ans = 0;
  long long int n = s.size();
  for (long long int i = n - 1; i >= 0; i--) {
    if (s[i] == '1') ans += pow(2, n - i - 1);
  }
  return ans;
}
long long int solve(string a, long long int base) {
  long long int ans = 0;
  long long int n = a.size();
  for (long long int i = n - 1; i >= 0; i--) {
    long long int x;
    char y = a[i];
    if (y - '0' <= 9)
      x = y - '0';
    else
      x = y - 'A' + 10;
    ans += (x * pow(base, n - i - 1));
  }
  return ans;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  string a, b;
  long long int i = 0;
  while (s[i] != ':') {
    a.push_back(s[i]);
    i++;
  }
  b = s.substr(i + 1);
  bool flag = 1;
  if (a.size() > 1) {
    for (long long int i = 0; i <= a.size() - 1 - 1; i++) {
      if (a[i] != '0') flag = 0;
    }
  }
  if (flag) {
    if (b.size() > 1) {
      for (long long int i = 0; i <= b.size() - 1 - 1; i++) {
        if (b[i] != '0') flag = 0;
      }
    }
    if (flag) {
      if ((long long int)a[a.size() - 1] <= 78) {
        cout << -1 << "\n";
        return 0;
      }
    }
  }
  char maxi = '0';
  for (long long int j = 0; j <= a.size() - 1; j++) {
    maxi = max(maxi, a[j]);
  }
  for (long long int j = 0; j <= b.size() - 1; j++) {
    maxi = max(maxi, b[j]);
  }
  long long int base;
  if (maxi == '9')
    base = 10;
  else if ((long long int)maxi >= 65)
    base = maxi - 'A' + 11;
  else
    base = maxi - '0' + 1;
  vector<long long int> ans;
  long long int hr = solve(a, base);
  long long int min = solve(b, base);
  while (0 <= hr and hr < 24 and 0 <= min and min < 60) {
    ans.push_back(base);
    base++;
    hr = solve(a, base);
    min = solve(b, base);
  }
  if (ans.size() == 0)
    cout << 0;
  else {
    for (auto i : ans) cout << i << " ";
  }
}
