import java.util.Scanner;
public class GCDDemo {
public static void main(String []args){
Scanner input =new Scanner(System.in);
System.out.print("第一个整数是:");
int m=input.nextInt();
System.out.print("第二个整数是:");
int n=input.nextInt();
int gcd=1;
int k=2;
while(k<=m&&k<=n){
if(m%k==0&&n%k==0){
gcd=k;
}
k++;
}
System.out.println(m+"与"+n+"最大公约数是"+gcd);
}
}