import java.util.Scanner;
// 输入两个数,求这两个数的最大公因数
public class Work4 {
//主函数
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int x = scanner.nextInt();
int y = scanner.nextInt();
int out = euclidean_algorithm(x,y);
System.out.println(out);
scanner.close();
}
//利用辗转相除法构造一个递归函数
public static int euclidean_algorithm(int a, int b){
if(b==0){
return a;}
return euclidean_algorithm(b,a%b);
}
}