#include <stdio.h>
#include <string.h>
#include <math.h>
#define Max 100  //输入数字限定最大值,视情况而更改
int gy(int a, int b) {
    if (a == b) {
        return a;
    } else if (a > b) {
        return gy(a - b, b);
    } else {
        return gy(a, b - a);
    }
}
int main() {
    char x[Max], y[Max];
    scanf("%s %s", x, y);
    int l1 = (int)strlen(x), l2 = (int)strlen(y), x1 = 0, y1 = 0;
    //对两数字进行数乘操作,和为z数组;
    int a[Max] = { 0 }, b[Max] = { 0 };
    for (int i = 0, n = l1 - 1; i < l1; i++, n--) {
        a[i] = x[n] - '0';
        x1 += a[i] * (int)pow(10, i);
    }
    for (int i = 0, n = l2 - 1; i < l2; i++, n--) {
        b[i] = y[n] - '0';
        y1 += b[i] * (int)pow(10, i);
    }  //将数字按位置从0到最大位保存到数组里
    int pro[Max * Max] = { 0 };
    for (int i = 0; i < l1; i++) {
        for (int j = 0; j < l2; j++) pro[i + j] += a[i] * b[j];
    }  //对应数相乘，不考虑进位，保持对应列数值。
    for (int i = 0; i < l1 + l2; i++) {
        if (pro[i] > 9) {
            pro[i + 1] += (pro[i] / 10);
            pro[i] %= 10;
        }
    }  //进位
    int begain = l1 + l2 - 1;
    for (; pro[begain] == 0; begain--) {
    }
    //乘法完成，且最高位储存在begain处；
    //完成除法运算。
    int z = gy(x1, y1);
    for (int i = begain; i >= 0; i--) {
        if (i > 0) {
            pro[i - 1] += (pro[i] % z * 10);
        }
        pro[i] /= z;
    }
    for (; pro[begain] == 0; begain--) {
    }
    printf("%d ", z);
    for (int i = begain; i >= 0; i--) {
        printf("%d", pro[i]);
    }
}