#include<cstdio>#include<algorithm>using namespace std;bool f1, f2;void dfs(int numa, int numb, int k){if(numb == 1) { f2 = true; if(numa == 1) f1 = true; }if(k == 1 || (f1 && f2)) return;if(numa % k == 0) dfs(numa / k, numb, k - 1); if(numb % k == 0) dfs(numa, numb / k, k - 1); dfs(numa, numb, k - 1); }int main(){int a, b;while(scanf("%d%d",&a,&b) != EOF){if(a < b) swap(a, b);f1 = f2 = false;dfs(a, b, 100);if(!f1 && f2) printf("%dn",b);else printf("%dn",a);}return 0;}
