On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The rule is very simple.  On the ground there are 100 labeled balloons, with the numbers 1 to 100.  After the referee shouts "Let's go!" the two players, who each starts with a score of  "1", race to crash the balloons by their feet and, at the same time, multiply their scores by the numbers written on the balloons they crash.  After a minute, the little audiences are allowed to take the remaining balloons away, and each contestant reports hisher score, the product of the numbers on the balloons heshe's crashed.  The unofficial winner is the player who announced the highest score.

Inevitably, though, disputes arise, and so the official winner is not determined until the disputes are resolved.  The player who claims the lower score is entitled to challenge hisher opponent's score.  The player with the lower score is presumed to have told the truth, because if heshe were to lie about hisher score, heshe would surely come up with a bigger better lie.  The challenge is upheld if the player with the higher score has a score that cannot be achieved with balloons not crashed by the challenging player.  So, if the challenge is successful, the player claiming the lower score wins.

So, for example, if one player claims 343 points and the other claims 49, then clearly the first player is lying; the only way to score 343 is by crashing balloons labeled 7 and 49, and the only way to score 49 is by crashing a balloon labeled 49.  Since each of two scores requires crashing the balloon labeled 49, the one claiming 343 points is presumed to be lying.

On the other hand, if one player claims 162 points and the other claims 81, it is possible for both to be telling the truth (e.g. one crashes balloons 2, 3 and 27, while the other crashes balloon 81), so the challenge would not be upheld.

By the way, if the challenger made a mistake on calculating his/her score, then the challenge would not be upheld. For example, if one player claims 10001 points and the other claims 10003, then clearly none of them are telling the truth. In this case, the challenge would not be upheld.

Unfortunately, anyone who is willing to referee a game of crashing balloon is likely to get over-excited in the hot atmosphere that heshe could not reasonably be expected to perform the intricate calculations that refereeing requires.  Hence the need for you, sober programmer, to provide a software solution.

Output

Sample Input

343 49
3599 610
62 36

Sample Output

 1 import java.util.Scanner;
 2 
 3 public class Main {
 4      static int flagA, flagB;
 5      public static void dfs(int a,int b,int k){
 6           if(a==1&&b==1)
 7               flagA=1;
 8           if(b==1)
 9               flagB=1;
10           while((k<a||k<b)&&k<100){
11               k++;
12               if(a%k==0){
13                    dfs(a/k, b, k);
14                    if(flagA==1)
15                         return;
16               }
17               if(b%k==0){
18                    dfs(a, b/k, k);
19                    if(flagA==1)
20                         return;
21               }
22           }
23      }
24 
25      public static void main(String[] args) {
26           Scanner scanner=new Scanner(System.in);
27           char[] traslate =new char[20];
28           int key,numA,numB;
29           while(scanner.hasNextLine()){
30               String tempString=scanner.nextLine();
31               traslate=tempString.toCharArray();
32               int length=traslate.length;
33               int[] tra=new int[20];
34               key=numA=numB=0;
35               flagA=flagB=0;
36             for(int i=0;i<length;i++){
37                    if(traslate[i]==' '){
38                         tra[i]=-1;
39                         key=i;
40                    }
41               }
42               for(int i=0;i<length;i++){
43                    if(i<key){
44                         tra[i]=(int) ((traslate[i]-48)*Math.pow(10, key-1-i));
45                         numA+=tra[i];
46                    }
47                    if(i>key){
48                         tra[i]=(int) ((traslate[i]-48)*Math.pow(10, length-1-i));
49                         numB+=tra[i];
50                    }
51               }
52               dfs(numA, numB, 1);
53               if(flagA==0&&flagB==1)
54                    System.out.println(numB);
55               else {
56                    System.out.println(numA);
57               }
58           }
59      }
60 }

感悟：DFS需要深入学习，Java的输入问题也需要找时间好好解决。