Problem: Having stayed home alone, Petya decided to watch forbidden films on the Net in secret. "What ungentlemanly behavior!" — you can say that, of course, but don't be too harsh on the kid. In his country films about the Martians and other extraterrestrial civilizations are forbidden. It was very unfair to Petya as he adored adventure stories that featured lasers and robots. 

Today Petya is watching a shocking blockbuster about the Martians called "R2:D2". What can "R2:D2" possibly mean? It might be the Martian time represented in the Martian numeral system. Petya knows that time on Mars is counted just like on the Earth (that is, there are 24 hours and each hour has 60 minutes). The time is written as "a:b", where the string a stands for the number of hours (from 0 to 23 inclusive), and string b stands for the number of minutes (from 0 to 59 inclusive). The only thing Petya doesn't know is in what numeral system the Martian time is written.

Your task is to print the radixes of all numeral system which can contain the time "a:b".

Input

The first line contains a single string as "a:b" (without the quotes). There a is a non-empty string, consisting of numbers and uppercase Latin letters. String a shows the number of hours. String b is a non-empty string that consists of numbers and uppercase Latin letters. String b shows the number of minutes. The lengths of strings a and b are from 1 to 5 characters, inclusive. Please note that strings a and b can have leading zeroes that do not influence the result in any way (for example, string "008:1" in decimal notation denotes correctly written time).

We consider characters 0, 1, ..., 9 as denoting the corresponding digits of the number's representation in some numeral system, and characters A, B, ..., Z correspond to numbers 10, 11, ..., 35.

Output

Print the radixes of the numeral systems that can represent the time "a:b" in the increasing order. Separate the numbers with spaces or line breaks. If there is no numeral system that can represent time "a:b", print the single integer 0. If there are infinitely many numeral systems that can represent the time "a:b", print the single integer -1.

Note that on Mars any positional numeral systems with positive radix strictly larger than one are possible.

Examples

Input

11:20


Output

3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

Input

2A:13


Output

0


Input

000B:00001


Output

-1

Note

Let's consider the first sample. String "11:20" can be perceived, for example, as time 4:6, represented in the ternary numeral system or as time 17:32 in hexadecimal system. 

Let's consider the second sample test. String "2A:13" can't be perceived as correct time in any notation. For example, let's take the base-11 numeral notation. There the given string represents time 32:14 that isn't a correct time.

Let's consider the third sample. String "000B:00001" can be perceived as a correct time in the infinite number of numeral systems. If you need an example, you can take any numeral system with radix no less than 12.

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.math.*;

public class B {
    public static StreamTokenizer in = new StreamTokenizer(System.in);
    public static boolean bg = true;

    public static void main(String[] args) throws Exception {
        in = null;
        Scanner scan = new Scanner(System.in);
        String[] l1 = scan.next().split(":");
        char[] ll1 = l1[0].toCharArray();
        char[] ll2 = l1[1].toCharArray();
        
        int[] v1 = new int[ll1.length];
        int[] v2 = new int[ll2.length]; 
        for (int i=0;i<ll1.length;i++){
            v1[i] = qq(ll1[i]);
        }
        for (int i=0;i<ll2.length;i++){
            v2[i] = qq(ll2[i]);
        }
        ArrayList<Integer> fin = new ArrayList();
        if (check1(v1)&&check2(v2)){
            pn(-1);
            ex();
        }
        else if (check1(v1)&&!check2(v2)){
            HashSet<Integer> s2 = cd2(v2);
            for (int e: s2){
                if (e>v1[v1.length-1]){
                    fin.add(e);
                }
            }
        }
        else if (!check1(v1)&&check2(v2)){
            HashSet<Integer> s1 = cd1(v1);
            for (int e: s1){
                if (e>v2[v2.length-1]){
                    fin.add(e);
                }
            }
        }
        else {
            HashSet<Integer> s1 = cd1(v1);
            HashSet<Integer> s2 = cd2(v2);
            s1.retainAll(s2);
            
            fin.addAll(s1);
            
            
        }
        
        Collections.sort(fin);
        
        
        
        if (fin.size()==0){
            pn(0);
            ex();
        }
        for (int e: fin){
            p(e+" ");
        }
        pn("");
    }
    public static HashSet<Integer> cd1(int[] l1){
        HashSet<Integer> s1 = new HashSet();
        for (int i=1;;i++){
            if (ok(l1,i) ){
                int cur = parse(l1, i);
                if (cur<=23){
                    s1.add(i);
                }
                else {
                    break;
                }
            }
        }
        return s1;
    }
    public static HashSet<Integer> cd2(int[] l1){
        HashSet<Integer> s1 = new HashSet();
        for (int i=1;;i++){
            if (ok(l1,i) ){
                int cur = parse(l1, i);
                if (cur<=59){
                    s1.add(i);
                }
                else {
                    break;
                }
            }
        }
        return s1;
    }
    public static boolean check1(int[] l1){
        ArrayList<Integer> f1 = new ArrayList();
        for (int i=0;i<l1.length-1;i++){
            if (l1[i]!=0) return false;
        }
        if (l1[l1.length-1]<=23){
            return true;
        }
        return false;
    }
    public static boolean check2(int[] l1){
        ArrayList<Integer> f1 = new ArrayList();
        for (int i=0;i<l1.length-1;i++){
            if (l1[i]!=0) return false;
        }
        if (l1[l1.length-1]<=59){
            return true;
        }
        return false;
    }
    public static int parse(int[] l1, int rdx){
        int fin = 0;
        for (int e: l1){
            fin *= rdx;
            fin += e;
        }
        return fin;
    }
    public static boolean ok(int[] l1, int rdx){
        for (int e: l1){
            if (rdx <=e) return false;
        }
        return true;
    }
    public static int qq(char c1){
        if (c1 - '0'>=0
                &&c1 - '0'<=9
                ){
            return c1 - '0';
        }
        else return c1 - 'A' + 10;
    }
    private static int ni() throws Exception {
        in.nextToken();
        return (int) in.nval;
    }

    private static long nl() throws Exception {
        in.nextToken();
        return (long) in.nval;
    }

    private static double nd() throws Exception {
        in.nextToken();
        return in.nval;
    }

    private static void pn(Object o1) {
        System.out.println(o1);
    }

    private static void p(Object o1) {
        System.out.print(o1);
    }

    private static void ex() {
        System.exit(0);
    }
}