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);
}
}