CodeForces - 149B Martian Clock

B. Martian Clock

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 aand 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

Copy

11:20

output

Copy

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

input

Copy

2A:13

output

Copy

0

input

Copy

000B:00001

output

Copy

-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.

题意：

定义火星时间也是小时化为十进制后不能大于23，分钟化为十进制后不能大于59，给定一个时间，问在哪些进制中这个时间是合法时间

思路：

先处理一下前缀零，然后把冒号前后的串分开，遍历进制数暴力判断即可，需要注意一些小的细节

#include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
string s,s1,s2;
int tr(char c)
{
	if(c>='0'&&c<='9')
		return (c-'0');
	else if(c>='A'&&c<='Z')
		return (c-'A'+10);
}
bool check(int num)
{
	int sum1=0,sum2=0;
	int tmp=1;
	for(int i=s1.size()-1;i>=0;i--)
	{
		sum1+=tr(s1[i])*tmp;
		tmp*=num;
	}
	tmp=1;
	for(int i=s2.size()-1;i>=0;i--)
	{
		sum2+=tr(s2[i])*tmp;
		tmp*=num;
	}
	if(sum2>=60||sum1>=24)
	return false;
	return true;
}
int main()
{
	cin>>s;
	int maxx=-1;
	for(int i=0;i<s.size();i++)
	{
		if(s[i]==':')
		{
			s1=s.substr(0,i);
			s2=s.substr(i+1,s.size()-i-1);
		}
		else
		{
			maxx=max(maxx,tr(s[i]));
		}
	}
	while(*s1.begin()=='0')
	s1.erase(s1.begin());
	while(*s2.begin()=='0')
	s2.erase(s2.begin());
	if(s1.size()<=1&&s2.size()<=1&&tr(s1[0])<24&&tr(s2[0])<60)
	{
		printf("-1\n");
	}
	else if((s1.size()<=1&&s2.size()<=1)&&(tr(s1[0])>=24||tr(s2[0])>=60))
	{
		printf("0\n");
	}
	else
	{
		if(check(maxx+1)==false)
		{
			printf("0\n");
			return 0;
		}
		for(int num=maxx+1;;num++)
		{
			if(check(num))
			printf("%d ",num);
			else
			break;
		}
	}
}