#include <iostream>
using namespace std;
// 递归法求最大公约数
int gcd(int num1, int num2) {
if (num2 == 0) {
return num1;
} else {
return gcd(num2, num1 % num2);
}
}
int main() {
int num1, num2;
cin >> num1 >> num2;
int gcdResult = gcd(num1, num2);
cout << "最大公约数是:" << gcdResult << endl;
return 0;
}