import java.util.Scanner;
public class CommonDivisor {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a = in.nextInt();
int b = in.nextInt();
int oa = a;
int ob = b;
int remainder = 0;
int gcd = 1;
//使用for循环
for (int i = 2; i <= a && i <= b; i++)
{
if (a % i == 0 && b % i == 0)
{
gcd = i;
}
}
System.out.print(oa + "与" + ob + "的最大公约数为:" + gcd);
//辗转相除法
//1.如果b等于0,计算结束,a就是最大公约数;
//2.否则,计算a除以b的余数,让a等于b,而b等于那个余数
//3.回到第一步
while (b != 0)
{
remainder = a % b;
a = b;
b = remainder;
}
System.out.print(a + "与" + b + "的最大公约数为:" + a);
}
}